<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libcoap: uthash.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">libcoap<span id="projectnumber">&#160;4.2.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function() { init_codefold(0); });
/* @license-end */
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('uthash_8h_source.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>

<div class="header">
  <div class="headertitle"><div class="title">uthash.h</div></div>
</div><!--header-->
<div class="contents">
<a href="uthash_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">Copyright (c) 2003-2017, Troy D. Hanson     http://troydhanson.github.com/uthash/</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">All rights reserved.</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"></span> </div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment">Redistribution and use in source and binary forms, with or without</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">modification, are permitted provided that the following conditions are met:</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"></span> </div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment">    * Redistributions of source code must retain the above copyright</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">      notice, this list of conditions and the following disclaimer.</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"></span> </div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment">THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment">IS&quot; AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment">TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment">PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment">OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment">EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment">LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment">*/</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#ifndef UTHASH_H</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#define UTHASH_H</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa56cef9cb86dc1f4b5d27ee3a691077e">   27</a></span><span class="preprocessor">#define UTHASH_VERSION 2.0.2</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;string.h&gt;</span>   <span class="comment">/* memcmp, memset, strlen */</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;stddef.h&gt;</span>   <span class="comment">/* ptrdiff_t */</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;stdlib.h&gt;</span>   <span class="comment">/* exit */</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">/* These macros use decltype or the earlier __typeof GNU extension.</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment">   As decltype is only available in newer compilers (VS2010 or gcc 4.3+</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment">   when compiling c++ source) this code uses whatever method is needed</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">   or, for VS2008 where neither is available, uses casting workarounds. */</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#if !defined(DECLTYPE) &amp;&amp; !defined(NO_DECLTYPE)</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#if defined(_MSC_VER)   </span><span class="comment">/* MS compiler */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#if _MSC_VER &gt;= 1600 &amp;&amp; defined(__cplusplus)  </span><span class="comment">/* VS2010 or newer in C++ mode */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#define DECLTYPE(x) (decltype(x))</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#else                   </span><span class="comment">/* VS2008 or older (or VS2010 in C mode) */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#define NO_DECLTYPE</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#elif defined(__BORLANDC__) || defined(__ICCARM__) || defined(__LCC__) || defined(__WATCOMC__)</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#define NO_DECLTYPE</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#else                   </span><span class="comment">/* GNU, Sun and other compilers */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="uthash_8h.html#a716ba290563c2d955cb0c90d85874073">   47</a></span><span class="preprocessor">#define DECLTYPE(x) (__typeof(x))</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#ifdef NO_DECLTYPE</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#define DECLTYPE(x)</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="preprocessor">#define DECLTYPE_ASSIGN(dst,src)                                                 \</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="preprocessor">  char **_da_dst = (char**)(&amp;(dst));                                             \</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="preprocessor">  *_da_dst = (char*)(src);                                                       \</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="preprocessor">#else</span></div>
<div class="foldopen" id="foldopen00059" data-start="" data-end="">
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="uthash_8h.html#a3c736f2f2dd643f2987b2bc323e269ba">   59</a></span><span class="preprocessor">#define DECLTYPE_ASSIGN(dst,src)                                                 \</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="preprocessor">  (dst) = DECLTYPE(dst)(src);                                                    \</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">/* a number of the hash function use uint32_t which isn&#39;t defined on Pre VS2010 */</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="preprocessor">#if defined(_WIN32)</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="preprocessor">#if defined(_MSC_VER) &amp;&amp; _MSC_VER &gt;= 1600</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="preprocessor">#elif defined(__WATCOMC__) || defined(__MINGW32__) || defined(__CYGWIN__)</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_typedef" href="uthash_8h.html#a435d1572bf3f880d55459d9805097f62">uint32_t</a>;</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> <a class="code hl_typedef" href="uthash_8h.html#aba7bc1797add20fe3efdf37ced1182c5">uint8_t</a>;</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="preprocessor">#elif defined(__GNUC__) &amp;&amp; !defined(__VXWORKS__)</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="uthash_8h.html#a435d1572bf3f880d55459d9805097f62">   78</a></span><span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_typedef" href="uthash_8h.html#a435d1572bf3f880d55459d9805097f62">uint32_t</a>;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="uthash_8h.html#aba7bc1797add20fe3efdf37ced1182c5">   79</a></span><span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> <a class="code hl_typedef" href="uthash_8h.html#aba7bc1797add20fe3efdf37ced1182c5">uint8_t</a>;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="preprocessor">#ifndef uthash_fatal</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="uthash_8h.html#a03b52301b0ed976b6981ef33613320c1">   83</a></span><span class="preprocessor">#define uthash_fatal(msg) exit(-1)        </span><span class="comment">/* fatal error (out of memory,etc) */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="preprocessor">#ifndef uthash_malloc</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="uthash_8h.html#a861013aff36c0448f1888a2b0b5836d8">   86</a></span><span class="preprocessor">#define uthash_malloc(sz) malloc(sz)      </span><span class="comment">/* malloc fcn                      */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="preprocessor">#ifndef uthash_free</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="uthash_8h.html#a56cdf8c254fc700332c8e6a7263b4657">   89</a></span><span class="preprocessor">#define uthash_free(ptr,sz) free(ptr)     </span><span class="comment">/* free fcn                        */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="preprocessor">#ifndef uthash_bzero</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="uthash_8h.html#af6a40785784ca2d51cb59370eb64d7de">   92</a></span><span class="preprocessor">#define uthash_bzero(a,n) memset(a,&#39;\0&#39;,n)</span></div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="preprocessor">#ifndef uthash_memcmp</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="uthash_8h.html#a8ca9a884b81d487034b57f87d2f97fa4">   95</a></span><span class="preprocessor">#define uthash_memcmp(a,b,n) memcmp(a,b,n)</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="preprocessor">#ifndef uthash_strlen</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa14634cb1f894d48256362bae7239be6">   98</a></span><span class="preprocessor">#define uthash_strlen(s) strlen(s)</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="preprocessor">#ifndef uthash_noexpand_fyi</span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7cc237d8f87de3836b5390856cfc5c86">  102</a></span><span class="preprocessor">#define uthash_noexpand_fyi(tbl)          </span><span class="comment">/* can be defined to log noexpand  */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="preprocessor">#ifndef uthash_expand_fyi</span></div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="uthash_8h.html#a86ea78714da520989a6f7a764b4d71b4">  105</a></span><span class="preprocessor">#define uthash_expand_fyi(tbl)            </span><span class="comment">/* can be defined to log expands   */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment">/* initial number of buckets */</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="uthash_8h.html#a361cdc5e8d6d8fe5fae6912588ae15d0">  109</a></span><span class="preprocessor">#define HASH_INITIAL_NUM_BUCKETS 32U     </span><span class="comment">/* initial number of buckets        */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="uthash_8h.html#a0b39a5cf1d6c05c43bd8530db2ec908c">  110</a></span><span class="preprocessor">#define HASH_INITIAL_NUM_BUCKETS_LOG2 5U </span><span class="comment">/* lg2 of initial number of buckets */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="uthash_8h.html#a8ae3e6473261f6c4b78c030c94f5d68f">  111</a></span><span class="preprocessor">#define HASH_BKT_CAPACITY_THRESH 10U     </span><span class="comment">/* expand when bucket count reaches */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment">/* calculate the element whose hash handle address is hhp */</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"><a class="line" href="uthash_8h.html#a568e95048979b8b3e4ea1567fd91c186">  114</a></span><span class="preprocessor">#define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)-&gt;hho)))</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment">/* calculate the hash handle from element address elp */</span></div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="uthash_8h.html#a46261e43585c404cccf8ab0f5c6d271e">  116</a></span><span class="preprocessor">#define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle *)(((char*)(elp)) + ((tbl)-&gt;hho)))</span></div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
<div class="foldopen" id="foldopen00118" data-start="" data-end="">
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"><a class="line" href="uthash_8h.html#a5bc1c6438f5d6fc56b8dcbf4bbe50271">  118</a></span><span class="preprocessor">#define HASH_VALUE(keyptr,keylen,hashv)                                          \</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="preprocessor">  HASH_FCN(keyptr, keylen, hashv);                                               \</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
<div class="foldopen" id="foldopen00123" data-start="" data-end="">
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="uthash_8h.html#afc2b27fc2a6b13aece881528f45de693">  123</a></span><span class="preprocessor">#define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out)                 \</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="preprocessor">  (out) = NULL;                                                                  \</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="preprocessor">  if (head) {                                                                    \</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="preprocessor">    unsigned _hf_bkt;                                                            \</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="preprocessor">    HASH_TO_BKT(hashval, (head)-&gt;hh.tbl-&gt;num_buckets, _hf_bkt);                  \</span></div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="preprocessor">    if (HASH_BLOOM_TEST((head)-&gt;hh.tbl, hashval) != 0) {                         \</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="preprocessor">      HASH_FIND_IN_BKT((head)-&gt;hh.tbl, hh, (head)-&gt;hh.tbl-&gt;buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
<div class="foldopen" id="foldopen00135" data-start="" data-end="">
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"><a class="line" href="uthash_8h.html#ad4a1cd39c3044936c0e49d3f372c9dbf">  135</a></span><span class="preprocessor">#define HASH_FIND(hh,head,keyptr,keylen,out)                                     \</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="preprocessor">  unsigned _hf_hashv;                                                            \</span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="preprocessor">  HASH_VALUE(keyptr, keylen, _hf_hashv);                                         \</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="preprocessor">  HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out);               \</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="preprocessor">#ifdef HASH_BLOOM</span></div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="preprocessor">#define HASH_BLOOM_BITLEN (1UL &lt;&lt; HASH_BLOOM)</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="preprocessor">#define HASH_BLOOM_BYTELEN (HASH_BLOOM_BITLEN/8UL) + (((HASH_BLOOM_BITLEN%8UL)!=0UL) ? 1UL : 0UL)</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="preprocessor">#define HASH_BLOOM_MAKE(tbl)                                                     \</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="preprocessor">  (tbl)-&gt;bloom_nbits = HASH_BLOOM;                                               \</span></div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="preprocessor">  (tbl)-&gt;bloom_bv = (uint8_t*)uthash_malloc(HASH_BLOOM_BYTELEN);                 \</span></div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="preprocessor">  if (!(tbl)-&gt;bloom_bv) {                                                        \</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span><span class="preprocessor">    uthash_fatal(&quot;out of memory&quot;);                                               \</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="preprocessor">  uthash_bzero((tbl)-&gt;bloom_bv, HASH_BLOOM_BYTELEN);                             \</span></div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="preprocessor">  (tbl)-&gt;bloom_sig = HASH_BLOOM_SIGNATURE;                                       \</span></div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span><span class="preprocessor">#define HASH_BLOOM_FREE(tbl)                                                     \</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="preprocessor">  uthash_free((tbl)-&gt;bloom_bv, HASH_BLOOM_BYTELEN);                              \</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="preprocessor">#define HASH_BLOOM_BITSET(bv,idx) (bv[(idx)/8U] |= (1U &lt;&lt; ((idx)%8U)))</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="preprocessor">#define HASH_BLOOM_BITTEST(bv,idx) (bv[(idx)/8U] &amp; (1U &lt;&lt; ((idx)%8U)))</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="preprocessor">#define HASH_BLOOM_ADD(tbl,hashv)                                                \</span></div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="preprocessor">  HASH_BLOOM_BITSET((tbl)-&gt;bloom_bv, (hashv &amp; (uint32_t)((1UL &lt;&lt; (tbl)-&gt;bloom_nbits) - 1U)))</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span><span class="preprocessor">#define HASH_BLOOM_TEST(tbl,hashv)                                               \</span></div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="preprocessor">  HASH_BLOOM_BITTEST((tbl)-&gt;bloom_bv, (hashv &amp; (uint32_t)((1UL &lt;&lt; (tbl)-&gt;bloom_nbits) - 1U)))</span></div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="uthash_8h.html#a254f427772a1fe7a2480a8302af8f8b8">  171</a></span><span class="preprocessor">#define HASH_BLOOM_MAKE(tbl)</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="uthash_8h.html#ad6847ad938fc26bfd0726d7f159efd0a">  172</a></span><span class="preprocessor">#define HASH_BLOOM_FREE(tbl)</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="uthash_8h.html#acaad947212056cd8bfe3d660265fb2db">  173</a></span><span class="preprocessor">#define HASH_BLOOM_ADD(tbl,hashv)</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"><a class="line" href="uthash_8h.html#a06bfbf880899d54da35487d0d39c1009">  174</a></span><span class="preprocessor">#define HASH_BLOOM_TEST(tbl,hashv) (1)</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="uthash_8h.html#a81f88a18c0837c77f40926074e7811db">  175</a></span><span class="preprocessor">#define HASH_BLOOM_BYTELEN 0U</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
<div class="foldopen" id="foldopen00178" data-start="" data-end="">
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"><a class="line" href="uthash_8h.html#aeba971430f623b6334f565d9c7ec9de5">  178</a></span><span class="preprocessor">#define HASH_MAKE_TABLE(hh,head)                                                 \</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="preprocessor">  (head)-&gt;hh.tbl = (UT_hash_table*)uthash_malloc(sizeof(UT_hash_table));         \</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="preprocessor">  if (!(head)-&gt;hh.tbl) {                                                         \</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="preprocessor">    uthash_fatal(&quot;out of memory&quot;);                                               \</span></div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="preprocessor">  uthash_bzero((head)-&gt;hh.tbl, sizeof(UT_hash_table));                           \</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;tail = &amp;((head)-&gt;hh);                                          \</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;num_buckets = HASH_INITIAL_NUM_BUCKETS;                        \</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2;              \</span></div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;hho = (char*)(&amp;(head)-&gt;hh) - (char*)(head);                    \</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;buckets = (UT_hash_bucket*)uthash_malloc(                      \</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="preprocessor">      HASH_INITIAL_NUM_BUCKETS * sizeof(struct UT_hash_bucket));                 \</span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="preprocessor">  if (!(head)-&gt;hh.tbl-&gt;buckets) {                                                \</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span><span class="preprocessor">    uthash_fatal(&quot;out of memory&quot;);                                               \</span></div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span><span class="preprocessor">  uthash_bzero((head)-&gt;hh.tbl-&gt;buckets,                                          \</span></div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span><span class="preprocessor">      HASH_INITIAL_NUM_BUCKETS * sizeof(struct UT_hash_bucket));                 \</span></div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="preprocessor">  HASH_BLOOM_MAKE((head)-&gt;hh.tbl);                                               \</span></div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;signature = HASH_SIGNATURE;                                    \</span></div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
<div class="foldopen" id="foldopen00200" data-start="" data-end="">
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa0104b44f5a911bfda7fd9f939e1594f">  200</a></span><span class="preprocessor">#define HASH_REPLACE_BYHASHVALUE_INORDER(hh,head,fieldname,keylen_in,hashval,add,replaced,cmpfcn) \</span></div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span><span class="preprocessor">  (replaced) = NULL;                                                             \</span></div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="preprocessor">  HASH_FIND_BYHASHVALUE(hh, head, &amp;((add)-&gt;fieldname), keylen_in, hashval, replaced); \</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span><span class="preprocessor">  if (replaced) {                                                                \</span></div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="preprocessor">    HASH_DELETE(hh, head, replaced);                                             \</span></div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="preprocessor">  HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh, head, &amp;((add)-&gt;fieldname), keylen_in, hashval, add, cmpfcn); \</span></div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
<div class="foldopen" id="foldopen00210" data-start="" data-end="">
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="uthash_8h.html#ab7fc2175a455ed8e8351737b4f8b2842">  210</a></span><span class="preprocessor">#define HASH_REPLACE_BYHASHVALUE(hh,head,fieldname,keylen_in,hashval,add,replaced) \</span></div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="preprocessor">  (replaced) = NULL;                                                             \</span></div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span><span class="preprocessor">  HASH_FIND_BYHASHVALUE(hh, head, &amp;((add)-&gt;fieldname), keylen_in, hashval, replaced); \</span></div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span><span class="preprocessor">  if (replaced) {                                                                \</span></div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span><span class="preprocessor">    HASH_DELETE(hh, head, replaced);                                             \</span></div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="preprocessor">  HASH_ADD_KEYPTR_BYHASHVALUE(hh, head, &amp;((add)-&gt;fieldname), keylen_in, hashval, add); \</span></div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
<div class="foldopen" id="foldopen00220" data-start="" data-end="">
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="uthash_8h.html#a9897aa8b1ace582e7bbdef05f21cbc54">  220</a></span><span class="preprocessor">#define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced)                   \</span></div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span><span class="preprocessor">  unsigned _hr_hashv;                                                            \</span></div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="preprocessor">  HASH_VALUE(&amp;((add)-&gt;fieldname), keylen_in, _hr_hashv);                         \</span></div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="preprocessor">  HASH_REPLACE_BYHASHVALUE(hh, head, fieldname, keylen_in, _hr_hashv, add, replaced); \</span></div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
<div class="foldopen" id="foldopen00227" data-start="" data-end="">
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa6d7a872d8855c9b8bf55d62e8eb0430">  227</a></span><span class="preprocessor">#define HASH_REPLACE_INORDER(hh,head,fieldname,keylen_in,add,replaced,cmpfcn)    \</span></div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span><span class="preprocessor">  unsigned _hr_hashv;                                                            \</span></div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span><span class="preprocessor">  HASH_VALUE(&amp;((add)-&gt;fieldname), keylen_in, _hr_hashv);                         \</span></div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="preprocessor">  HASH_REPLACE_BYHASHVALUE_INORDER(hh, head, fieldname, keylen_in, _hr_hashv, add, replaced, cmpfcn); \</span></div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
<div class="foldopen" id="foldopen00234" data-start="" data-end="">
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"><a class="line" href="uthash_8h.html#aeec8f4c804ae5b87ebded933252804fd">  234</a></span><span class="preprocessor">#define HASH_APPEND_LIST(hh, head, add)                                          \</span></div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="preprocessor">  (add)-&gt;hh.next = NULL;                                                         \</span></div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="preprocessor">  (add)-&gt;hh.prev = ELMT_FROM_HH((head)-&gt;hh.tbl, (head)-&gt;hh.tbl-&gt;tail);           \</span></div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;tail-&gt;next = (add);                                            \</span></div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;tail = &amp;((add)-&gt;hh);                                           \</span></div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
<div class="foldopen" id="foldopen00242" data-start="" data-end="">
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa41008b04fa96e7597307145ac2e13d7">  242</a></span><span class="preprocessor">#define HASH_AKBI_INNER_LOOP(hh,head,add,cmpfcn)                                 \</span></div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="preprocessor">  do {                                                                           \</span></div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="preprocessor">    if (cmpfcn(DECLTYPE(head)(_hs_iter), add) &gt; 0) {                             \</span></div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="preprocessor">      break;                                                                     \</span></div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="preprocessor">  } while ((_hs_iter = HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_iter)-&gt;next));           \</span></div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span> </div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="preprocessor">#ifdef NO_DECLTYPE</span></div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="preprocessor">#undef HASH_AKBI_INNER_LOOP</span></div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="preprocessor">#define HASH_AKBI_INNER_LOOP(hh,head,add,cmpfcn)                                 \</span></div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span><span class="preprocessor">  char *_hs_saved_head = (char*)(head);                                          \</span></div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span><span class="preprocessor">  do {                                                                           \</span></div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="preprocessor">    DECLTYPE_ASSIGN(head, _hs_iter);                                             \</span></div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="preprocessor">    if (cmpfcn(head, add) &gt; 0) {                                                 \</span></div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="preprocessor">      DECLTYPE_ASSIGN(head, _hs_saved_head);                                     \</span></div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="preprocessor">      break;                                                                     \</span></div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="preprocessor">    DECLTYPE_ASSIGN(head, _hs_saved_head);                                       \</span></div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="preprocessor">  } while ((_hs_iter = HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_iter)-&gt;next));           \</span></div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
<div class="foldopen" id="foldopen00267" data-start="" data-end="">
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"><a class="line" href="uthash_8h.html#aae1fa76ff12cbf5328bcf4a2375d055f">  267</a></span><span class="preprocessor">#define HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh,head,keyptr,keylen_in,hashval,add,cmpfcn) \</span></div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span><span class="preprocessor">  unsigned _ha_bkt;                                                              \</span></div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span><span class="preprocessor">  (add)-&gt;hh.hashv = (hashval);                                                   \</span></div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="preprocessor">  (add)-&gt;hh.key = (char*) (keyptr);                                              \</span></div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span><span class="preprocessor">  (add)-&gt;hh.keylen = (unsigned) (keylen_in);                                     \</span></div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span><span class="preprocessor">  if (!(head)) {                                                                 \</span></div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span><span class="preprocessor">    (add)-&gt;hh.next = NULL;                                                       \</span></div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="preprocessor">    (add)-&gt;hh.prev = NULL;                                                       \</span></div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span><span class="preprocessor">    (head) = (add);                                                              \</span></div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span><span class="preprocessor">    HASH_MAKE_TABLE(hh, head);                                                   \</span></div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span><span class="preprocessor">  } else {                                                                       \</span></div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="preprocessor">    void *_hs_iter = (head);                                                     \</span></div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="preprocessor">    (add)-&gt;hh.tbl = (head)-&gt;hh.tbl;                                              \</span></div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span><span class="preprocessor">    HASH_AKBI_INNER_LOOP(hh, head, add, cmpfcn);                                 \</span></div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span><span class="preprocessor">    if (_hs_iter) {                                                              \</span></div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span><span class="preprocessor">      (add)-&gt;hh.next = _hs_iter;                                                 \</span></div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="preprocessor">      if (((add)-&gt;hh.prev = HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_iter)-&gt;prev)) {     \</span></div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="preprocessor">        HH_FROM_ELMT((head)-&gt;hh.tbl, (add)-&gt;hh.prev)-&gt;next = (add);              \</span></div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span><span class="preprocessor">      } else {                                                                   \</span></div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span><span class="preprocessor">        (head) = (add);                                                          \</span></div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span><span class="preprocessor">      HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_iter)-&gt;prev = (add);                      \</span></div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span><span class="preprocessor">    } else {                                                                     \</span></div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span><span class="preprocessor">      HASH_APPEND_LIST(hh, head, add);                                           \</span></div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;num_items++;                                                   \</span></div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="preprocessor">  HASH_TO_BKT(hashval, (head)-&gt;hh.tbl-&gt;num_buckets, _ha_bkt);                    \</span></div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span><span class="preprocessor">  HASH_ADD_TO_BKT((head)-&gt;hh.tbl-&gt;buckets[_ha_bkt], &amp;(add)-&gt;hh);                 \</span></div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span><span class="preprocessor">  HASH_BLOOM_ADD((head)-&gt;hh.tbl, hashval);                                       \</span></div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span><span class="preprocessor">  HASH_EMIT_KEY(hh, head, keyptr, keylen_in);                                    \</span></div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="preprocessor">  HASH_FSCK(hh, head, &quot;HASH_ADD_KEYPTR_BYHASHVALUE_INORDER&quot;);                    \</span></div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
<div class="foldopen" id="foldopen00302" data-start="" data-end="">
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"><a class="line" href="uthash_8h.html#a5a5f675b8bbeaff0a25de5f91330eae8">  302</a></span><span class="preprocessor">#define HASH_ADD_KEYPTR_INORDER(hh,head,keyptr,keylen_in,add,cmpfcn)             \</span></div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span><span class="preprocessor">  unsigned _hs_hashv;                                                            \</span></div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span><span class="preprocessor">  HASH_VALUE(keyptr, keylen_in, _hs_hashv);                                      \</span></div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span><span class="preprocessor">  HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh, head, keyptr, keylen_in, _hs_hashv, add, cmpfcn); \</span></div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span> </div>
<div class="foldopen" id="foldopen00309" data-start="" data-end="">
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7caae291b965a3f618661927481bf960">  309</a></span><span class="preprocessor">#define HASH_ADD_BYHASHVALUE_INORDER(hh,head,fieldname,keylen_in,hashval,add,cmpfcn) \</span></div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span><span class="preprocessor">  HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh, head, &amp;((add)-&gt;fieldname), keylen_in, hashval, add, cmpfcn)</span></div>
</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
<div class="foldopen" id="foldopen00312" data-start="" data-end="">
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"><a class="line" href="uthash_8h.html#a1befde1b63e6bc0cb4d6b34cb863eebe">  312</a></span><span class="preprocessor">#define HASH_ADD_INORDER(hh,head,fieldname,keylen_in,add,cmpfcn)                 \</span></div>
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span><span class="preprocessor">  HASH_ADD_KEYPTR_INORDER(hh, head, &amp;((add)-&gt;fieldname), keylen_in, add, cmpfcn)</span></div>
</div>
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span> </div>
<div class="foldopen" id="foldopen00315" data-start="" data-end="">
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"><a class="line" href="uthash_8h.html#aa0e4d9dcfb23a6616c6439aa0d4a3f4d">  315</a></span><span class="preprocessor">#define HASH_ADD_KEYPTR_BYHASHVALUE(hh,head,keyptr,keylen_in,hashval,add)        \</span></div>
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span><span class="preprocessor">  unsigned _ha_bkt;                                                              \</span></div>
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span><span class="preprocessor">  (add)-&gt;hh.hashv = (hashval);                                                   \</span></div>
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="preprocessor">  (add)-&gt;hh.key = (const void *) (keyptr);                                       \</span></div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="preprocessor">  (add)-&gt;hh.keylen = (unsigned) (keylen_in);                                     \</span></div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span><span class="preprocessor">  if (!(head)) {                                                                 \</span></div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span><span class="preprocessor">    (add)-&gt;hh.next = NULL;                                                       \</span></div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span><span class="preprocessor">    (add)-&gt;hh.prev = NULL;                                                       \</span></div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span><span class="preprocessor">    (head) = (add);                                                              \</span></div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span><span class="preprocessor">    HASH_MAKE_TABLE(hh, head);                                                   \</span></div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span><span class="preprocessor">  } else {                                                                       \</span></div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="preprocessor">    (add)-&gt;hh.tbl = (head)-&gt;hh.tbl;                                              \</span></div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="preprocessor">    HASH_APPEND_LIST(hh, head, add);                                             \</span></div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="preprocessor">  (head)-&gt;hh.tbl-&gt;num_items++;                                                   \</span></div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="preprocessor">  HASH_TO_BKT(hashval, (head)-&gt;hh.tbl-&gt;num_buckets, _ha_bkt);                    \</span></div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="preprocessor">  HASH_ADD_TO_BKT((head)-&gt;hh.tbl-&gt;buckets[_ha_bkt], &amp;(add)-&gt;hh);                 \</span></div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="preprocessor">  HASH_BLOOM_ADD((head)-&gt;hh.tbl, hashval);                                       \</span></div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span><span class="preprocessor">  HASH_EMIT_KEY(hh, head, keyptr, keylen_in);                                    \</span></div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span><span class="preprocessor">  HASH_FSCK(hh, head, &quot;HASH_ADD_KEYPTR_BYHASHVALUE&quot;);                            \</span></div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> </div>
<div class="foldopen" id="foldopen00338" data-start="" data-end="">
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"><a class="line" href="uthash_8h.html#a0b7468360b5c788762cdb2ccf9cd4d26">  338</a></span><span class="preprocessor">#define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add)                            \</span></div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span><span class="preprocessor">  unsigned _ha_hashv;                                                            \</span></div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span><span class="preprocessor">  HASH_VALUE(keyptr, keylen_in, _ha_hashv);                                      \</span></div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span><span class="preprocessor">  HASH_ADD_KEYPTR_BYHASHVALUE(hh, head, keyptr, keylen_in, _ha_hashv, add);      \</span></div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span> </div>
<div class="foldopen" id="foldopen00345" data-start="" data-end="">
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"><a class="line" href="uthash_8h.html#a34a0dfca975d8b5ae83d9c307c8d6305">  345</a></span><span class="preprocessor">#define HASH_ADD_BYHASHVALUE(hh,head,fieldname,keylen_in,hashval,add)            \</span></div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span><span class="preprocessor">  HASH_ADD_KEYPTR_BYHASHVALUE(hh, head, &amp;((add)-&gt;fieldname), keylen_in, hashval, add)</span></div>
</div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span> </div>
<div class="foldopen" id="foldopen00348" data-start="" data-end="">
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"><a class="line" href="uthash_8h.html#aaf01358e257c8d838eb5e4b189f0c399">  348</a></span><span class="preprocessor">#define HASH_ADD(hh,head,fieldname,keylen_in,add)                                \</span></div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span><span class="preprocessor">  HASH_ADD_KEYPTR(hh, head, &amp;((add)-&gt;fieldname), keylen_in, add)</span></div>
</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span> </div>
<div class="foldopen" id="foldopen00351" data-start="" data-end="">
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"><a class="line" href="uthash_8h.html#a4d7691544128a6ef265f3e4fa5ed3113">  351</a></span><span class="preprocessor">#define HASH_TO_BKT(hashv,num_bkts,bkt)                                          \</span></div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span><span class="preprocessor">  bkt = ((hashv) &amp; ((num_bkts) - 1U));                                           \</span></div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="comment">/* delete &quot;delptr&quot; from the hash table.</span></div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span><span class="comment"> * &quot;the usual&quot; patch-up process for the app-order doubly-linked-list.</span></div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span><span class="comment"> * The use of _hd_hh_del below deserves special explanation.</span></div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span><span class="comment"> * These used to be expressed using (delptr) but that led to a bug</span></div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span><span class="comment"> * if someone used the same symbol for the head and deletee, like</span></div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span><span class="comment"> *  HASH_DELETE(hh,users,users);</span></div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span><span class="comment"> * We want that to work, but by changing the head (users) below</span></div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span><span class="comment"> * we were forfeiting our ability to further refer to the deletee (users)</span></div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span><span class="comment"> * in the patch-up process. Solution: use scratch space to</span></div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span><span class="comment"> * copy the deletee pointer, then the latter references are via that</span></div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span><span class="comment"> * scratch pointer rather than through the repointed (users) symbol.</span></div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span><span class="comment"> */</span></div>
<div class="foldopen" id="foldopen00368" data-start="" data-end="">
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"><a class="line" href="uthash_8h.html#a3f83117e1108d63844a58d2d79c3b980">  368</a></span><span class="preprocessor">#define HASH_DELETE(hh,head,delptr)                                              \</span></div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span><span class="preprocessor">    HASH_DELETE_HH(hh, head, &amp;(delptr)-&gt;hh)</span></div>
</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span> </div>
<div class="foldopen" id="foldopen00371" data-start="" data-end="">
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"><a class="line" href="uthash_8h.html#acfd98e13ba4bbdd68a476cd8dbaaa03c">  371</a></span><span class="preprocessor">#define HASH_DELETE_HH(hh,head,delptrhh)                                         \</span></div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span><span class="preprocessor">  struct UT_hash_handle *_hd_hh_del = (delptrhh);                                \</span></div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span><span class="preprocessor">  if ((_hd_hh_del-&gt;prev == NULL) &amp;&amp; (_hd_hh_del-&gt;next == NULL)) {                \</span></div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span><span class="preprocessor">    HASH_BLOOM_FREE((head)-&gt;hh.tbl);                                             \</span></div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span><span class="preprocessor">    uthash_free((head)-&gt;hh.tbl-&gt;buckets,                                         \</span></div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span><span class="preprocessor">                (head)-&gt;hh.tbl-&gt;num_buckets * sizeof(struct UT_hash_bucket));    \</span></div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span><span class="preprocessor">    uthash_free((head)-&gt;hh.tbl, sizeof(UT_hash_table));                          \</span></div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span><span class="preprocessor">    (head) = NULL;                                                               \</span></div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span><span class="preprocessor">  } else {                                                                       \</span></div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span><span class="preprocessor">    unsigned _hd_bkt;                                                            \</span></div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span><span class="preprocessor">    if (_hd_hh_del == (head)-&gt;hh.tbl-&gt;tail) {                                    \</span></div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span><span class="preprocessor">      (head)-&gt;hh.tbl-&gt;tail = HH_FROM_ELMT((head)-&gt;hh.tbl, _hd_hh_del-&gt;prev);     \</span></div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span><span class="preprocessor">    if (_hd_hh_del-&gt;prev != NULL) {                                              \</span></div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span><span class="preprocessor">      HH_FROM_ELMT((head)-&gt;hh.tbl, _hd_hh_del-&gt;prev)-&gt;next = _hd_hh_del-&gt;next;   \</span></div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span><span class="preprocessor">    } else {                                                                     \</span></div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span><span class="preprocessor">      DECLTYPE_ASSIGN(head, _hd_hh_del-&gt;next);                                   \</span></div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span><span class="preprocessor">    if (_hd_hh_del-&gt;next != NULL) {                                              \</span></div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span><span class="preprocessor">      HH_FROM_ELMT((head)-&gt;hh.tbl, _hd_hh_del-&gt;next)-&gt;prev = _hd_hh_del-&gt;prev;   \</span></div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span><span class="preprocessor">    HASH_TO_BKT(_hd_hh_del-&gt;hashv, (head)-&gt;hh.tbl-&gt;num_buckets, _hd_bkt);        \</span></div>
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span><span class="preprocessor">    HASH_DEL_IN_BKT((head)-&gt;hh.tbl-&gt;buckets[_hd_bkt], _hd_hh_del);               \</span></div>
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span><span class="preprocessor">    (head)-&gt;hh.tbl-&gt;num_items--;                                                 \</span></div>
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span><span class="preprocessor">  HASH_FSCK(hh, head, &quot;HASH_DELETE&quot;);                                            \</span></div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span> </div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> </div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span><span class="comment">/* convenience forms of HASH_FIND/HASH_ADD/HASH_DEL */</span></div>
<div class="foldopen" id="foldopen00402" data-start="" data-end="">
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"><a class="line" href="uthash_8h.html#a214529083adfab2fa8cd402d2eeb0a84">  402</a></span><span class="preprocessor">#define HASH_FIND_STR(head,findstr,out)                                          \</span></div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span><span class="preprocessor">    HASH_FIND(hh,head,findstr,(unsigned)uthash_strlen(findstr),out)</span></div>
</div>
<div class="foldopen" id="foldopen00404" data-start="" data-end="">
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"><a class="line" href="uthash_8h.html#a9724951736f3985f74df17638c8a7885">  404</a></span><span class="preprocessor">#define HASH_ADD_STR(head,strfield,add)                                          \</span></div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span><span class="preprocessor">    HASH_ADD(hh,head,strfield[0],(unsigned)uthash_strlen(add-&gt;strfield),add)</span></div>
</div>
<div class="foldopen" id="foldopen00406" data-start="" data-end="">
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"><a class="line" href="uthash_8h.html#a069b31f4fbc11094d8d3d5e3b1a641db">  406</a></span><span class="preprocessor">#define HASH_REPLACE_STR(head,strfield,add,replaced)                             \</span></div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span><span class="preprocessor">    HASH_REPLACE(hh,head,strfield[0],(unsigned)uthash_strlen(add-&gt;strfield),add,replaced)</span></div>
</div>
<div class="foldopen" id="foldopen00408" data-start="" data-end="">
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"><a class="line" href="uthash_8h.html#aadcb19b940348f3141bd51505ede0142">  408</a></span><span class="preprocessor">#define HASH_FIND_INT(head,findint,out)                                          \</span></div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span><span class="preprocessor">    HASH_FIND(hh,head,findint,sizeof(int),out)</span></div>
</div>
<div class="foldopen" id="foldopen00410" data-start="" data-end="">
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"><a class="line" href="uthash_8h.html#acf85835471af894e354efb7e346698f3">  410</a></span><span class="preprocessor">#define HASH_ADD_INT(head,intfield,add)                                          \</span></div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span><span class="preprocessor">    HASH_ADD(hh,head,intfield,sizeof(int),add)</span></div>
</div>
<div class="foldopen" id="foldopen00412" data-start="" data-end="">
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"><a class="line" href="uthash_8h.html#a43124846a2747f48f45bf9f16631a6da">  412</a></span><span class="preprocessor">#define HASH_REPLACE_INT(head,intfield,add,replaced)                             \</span></div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span><span class="preprocessor">    HASH_REPLACE(hh,head,intfield,sizeof(int),add,replaced)</span></div>
</div>
<div class="foldopen" id="foldopen00414" data-start="" data-end="">
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"><a class="line" href="uthash_8h.html#a26a887f8e31952034becac0cf446f6c3">  414</a></span><span class="preprocessor">#define HASH_FIND_PTR(head,findptr,out)                                          \</span></div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span><span class="preprocessor">    HASH_FIND(hh,head,findptr,sizeof(void *),out)</span></div>
</div>
<div class="foldopen" id="foldopen00416" data-start="" data-end="">
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"><a class="line" href="uthash_8h.html#a2ad1f84ef1ba9df99fa2ada38cb61823">  416</a></span><span class="preprocessor">#define HASH_ADD_PTR(head,ptrfield,add)                                          \</span></div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span><span class="preprocessor">    HASH_ADD(hh,head,ptrfield,sizeof(void *),add)</span></div>
</div>
<div class="foldopen" id="foldopen00418" data-start="" data-end="">
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"><a class="line" href="uthash_8h.html#a13bcd1176a34c0a924fbf187c897bf68">  418</a></span><span class="preprocessor">#define HASH_REPLACE_PTR(head,ptrfield,add,replaced)                             \</span></div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span><span class="preprocessor">    HASH_REPLACE(hh,head,ptrfield,sizeof(void *),add,replaced)</span></div>
</div>
<div class="foldopen" id="foldopen00420" data-start="" data-end="">
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"><a class="line" href="uthash_8h.html#a48b7ed374602dcb236501aa23a971f05">  420</a></span><span class="preprocessor">#define HASH_DEL(head,delptr)                                                    \</span></div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span><span class="preprocessor">    HASH_DELETE(hh,head,delptr)</span></div>
</div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span> </div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span><span class="comment">/* HASH_FSCK checks hash integrity on every add/delete when HASH_DEBUG is defined.</span></div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span><span class="comment"> * This is for uthash developer only; it compiles away if HASH_DEBUG isn&#39;t defined.</span></div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span><span class="comment"> */</span></div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span><span class="preprocessor">#ifdef HASH_DEBUG</span></div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span><span class="preprocessor">#define HASH_OOPS(...) do { fprintf(stderr,__VA_ARGS__); exit(-1); } while (0)</span></div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span><span class="preprocessor">#define HASH_FSCK(hh,head,where)                                                 \</span></div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span><span class="preprocessor">  struct UT_hash_handle *_thh;                                                   \</span></div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span><span class="preprocessor">  if (head) {                                                                    \</span></div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span><span class="preprocessor">    unsigned _bkt_i;                                                             \</span></div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span><span class="preprocessor">    unsigned _count = 0;                                                         \</span></div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span><span class="preprocessor">    char *_prev;                                                                 \</span></div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span><span class="preprocessor">    for (_bkt_i = 0; _bkt_i &lt; (head)-&gt;hh.tbl-&gt;num_buckets; ++_bkt_i) {           \</span></div>
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span><span class="preprocessor">      unsigned _bkt_count = 0;                                                   \</span></div>
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span><span class="preprocessor">      _thh = (head)-&gt;hh.tbl-&gt;buckets[_bkt_i].hh_head;                            \</span></div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span><span class="preprocessor">      _prev = NULL;                                                              \</span></div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span><span class="preprocessor">      while (_thh) {                                                             \</span></div>
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span><span class="preprocessor">        if (_prev != (char*)(_thh-&gt;hh_prev)) {                                   \</span></div>
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span><span class="preprocessor">          HASH_OOPS(&quot;%s: invalid hh_prev %p, actual %p\n&quot;,                       \</span></div>
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span><span class="preprocessor">              (where), (void*)_thh-&gt;hh_prev, (void*)_prev);                      \</span></div>
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span><span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span><span class="preprocessor">        _bkt_count++;                                                            \</span></div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span><span class="preprocessor">        _prev = (char*)(_thh);                                                   \</span></div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span><span class="preprocessor">        _thh = _thh-&gt;hh_next;                                                    \</span></div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span><span class="preprocessor">      _count += _bkt_count;                                                      \</span></div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span><span class="preprocessor">      if ((head)-&gt;hh.tbl-&gt;buckets[_bkt_i].count !=  _bkt_count) {                \</span></div>
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span><span class="preprocessor">        HASH_OOPS(&quot;%s: invalid bucket count %u, actual %u\n&quot;,                    \</span></div>
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span><span class="preprocessor">            (where), (head)-&gt;hh.tbl-&gt;buckets[_bkt_i].count, _bkt_count);         \</span></div>
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span><span class="preprocessor">    if (_count != (head)-&gt;hh.tbl-&gt;num_items) {                                   \</span></div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span><span class="preprocessor">      HASH_OOPS(&quot;%s: invalid hh item count %u, actual %u\n&quot;,                     \</span></div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span><span class="preprocessor">          (where), (head)-&gt;hh.tbl-&gt;num_items, _count);                           \</span></div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span><span class="preprocessor">    _count = 0;                                                                  \</span></div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span><span class="preprocessor">    _prev = NULL;                                                                \</span></div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span><span class="preprocessor">    _thh =  &amp;(head)-&gt;hh;                                                         \</span></div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span><span class="preprocessor">    while (_thh) {                                                               \</span></div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span><span class="preprocessor">      _count++;                                                                  \</span></div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span><span class="preprocessor">      if (_prev != (char*)_thh-&gt;prev) {                                          \</span></div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span><span class="preprocessor">        HASH_OOPS(&quot;%s: invalid prev %p, actual %p\n&quot;,                            \</span></div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span><span class="preprocessor">            (where), (void*)_thh-&gt;prev, (void*)_prev);                           \</span></div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span><span class="preprocessor">      _prev = (char*)ELMT_FROM_HH((head)-&gt;hh.tbl, _thh);                         \</span></div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span><span class="preprocessor">      _thh = (_thh-&gt;next ? HH_FROM_ELMT((head)-&gt;hh.tbl, _thh-&gt;next) : NULL);     \</span></div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span><span class="preprocessor">    if (_count != (head)-&gt;hh.tbl-&gt;num_items) {                                   \</span></div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span><span class="preprocessor">      HASH_OOPS(&quot;%s: invalid app item count %u, actual %u\n&quot;,                    \</span></div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span><span class="preprocessor">          (where), (head)-&gt;hh.tbl-&gt;num_items, _count);                           \</span></div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"><a class="line" href="uthash_8h.html#a1ed67af67bb06c4bc02976899b4da853">  477</a></span><span class="preprocessor">#define HASH_FSCK(hh,head,where)</span></div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span> </div>
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span><span class="comment">/* When compiled with -DHASH_EMIT_KEYS, length-prefixed keys are emitted to</span></div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span><span class="comment"> * the descriptor to which this macro is defined for tuning the hash function.</span></div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span><span class="comment"> * The app can #include &lt;unistd.h&gt; to get the prototype for write(2). */</span></div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span><span class="preprocessor">#ifdef HASH_EMIT_KEYS</span></div>
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span><span class="preprocessor">#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)                                   \</span></div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span><span class="preprocessor">  unsigned _klen = fieldlen;                                                     \</span></div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span><span class="preprocessor">  write(HASH_EMIT_KEYS, &amp;_klen, sizeof(_klen));                                  \</span></div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span><span class="preprocessor">  write(HASH_EMIT_KEYS, keyptr, (unsigned long)fieldlen);                        \</span></div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"><a class="line" href="uthash_8h.html#a44f9d46e2cc79652492e5dd3e6c40a15">  491</a></span><span class="preprocessor">#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)</span></div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span> </div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span><span class="comment">/* default to Jenkin&#39;s hash unless overridden e.g. DHASH_FUNCTION=HASH_SAX */</span></div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span><span class="preprocessor">#ifdef HASH_FUNCTION</span></div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span><span class="preprocessor">#define HASH_FCN HASH_FUNCTION</span></div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span><span class="preprocessor">#else</span></div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"><a class="line" href="uthash_8h.html#abd3356419b386c379116393700a751d3">  498</a></span><span class="preprocessor">#define HASH_FCN HASH_JEN</span></div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span> </div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span><span class="comment">/* The Bernstein hash function, used in Perl prior to v5.6. Note (x&lt;&lt;5+x)=x*33. */</span></div>
<div class="foldopen" id="foldopen00502" data-start="" data-end="">
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7fb1644fa1d057a1c124c7548b9146b3">  502</a></span><span class="preprocessor">#define HASH_BER(key,keylen,hashv)                                               \</span></div>
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span><span class="preprocessor">  unsigned _hb_keylen = (unsigned)keylen;                                        \</span></div>
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span><span class="preprocessor">  const unsigned char *_hb_key = (const unsigned char*)(key);                    \</span></div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span><span class="preprocessor">  (hashv) = 0;                                                                   \</span></div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span><span class="preprocessor">  while (_hb_keylen-- != 0U) {                                                   \</span></div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span><span class="preprocessor">    (hashv) = (((hashv) &lt;&lt; 5) + (hashv)) + *_hb_key++;                           \</span></div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span> </div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span> </div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span><span class="comment">/* SAX/FNV/OAT/JEN hash functions are macro variants of those listed at</span></div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span><span class="comment"> * http://eternallyconfuzzled.com/tuts/algorithms/jsw_tut_hashing.aspx */</span></div>
<div class="foldopen" id="foldopen00515" data-start="" data-end="">
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"><a class="line" href="uthash_8h.html#ae8cf38dbd44a475eb0fa4cdb9988e13a">  515</a></span><span class="preprocessor">#define HASH_SAX(key,keylen,hashv)                                               \</span></div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span><span class="preprocessor">  unsigned _sx_i;                                                                \</span></div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span><span class="preprocessor">  const unsigned char *_hs_key = (const unsigned char*)(key);                    \</span></div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span><span class="preprocessor">  hashv = 0;                                                                     \</span></div>
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span><span class="preprocessor">  for (_sx_i=0; _sx_i &lt; keylen; _sx_i++) {                                       \</span></div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span><span class="preprocessor">    hashv ^= (hashv &lt;&lt; 5) + (hashv &gt;&gt; 2) + _hs_key[_sx_i];                       \</span></div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span><span class="comment">/* FNV-1a variation */</span></div>
<div class="foldopen" id="foldopen00525" data-start="" data-end="">
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"><a class="line" href="uthash_8h.html#a65c61fa2c45a7d0cb918407d725e94bc">  525</a></span><span class="preprocessor">#define HASH_FNV(key,keylen,hashv)                                               \</span></div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span><span class="preprocessor">  unsigned _fn_i;                                                                \</span></div>
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span><span class="preprocessor">  const unsigned char *_hf_key = (const unsigned char*)(key);                    \</span></div>
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span><span class="preprocessor">  (hashv) = 2166136261U;                                                         \</span></div>
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span><span class="preprocessor">  for (_fn_i=0; _fn_i &lt; keylen; _fn_i++) {                                       \</span></div>
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span><span class="preprocessor">    hashv = hashv ^ _hf_key[_fn_i];                                              \</span></div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span><span class="preprocessor">    hashv = hashv * 16777619U;                                                   \</span></div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span> </div>
<div class="foldopen" id="foldopen00536" data-start="" data-end="">
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"><a class="line" href="uthash_8h.html#a22c77754346c75bfafd872d2d49c6dc7">  536</a></span><span class="preprocessor">#define HASH_OAT(key,keylen,hashv)                                               \</span></div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span><span class="preprocessor">  unsigned _ho_i;                                                                \</span></div>
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span><span class="preprocessor">  const unsigned char *_ho_key=(const unsigned char*)(key);                      \</span></div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span><span class="preprocessor">  hashv = 0;                                                                     \</span></div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span><span class="preprocessor">  for(_ho_i=0; _ho_i &lt; keylen; _ho_i++) {                                        \</span></div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span><span class="preprocessor">      hashv += _ho_key[_ho_i];                                                   \</span></div>
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span><span class="preprocessor">      hashv += (hashv &lt;&lt; 10);                                                    \</span></div>
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span><span class="preprocessor">      hashv ^= (hashv &gt;&gt; 6);                                                     \</span></div>
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span><span class="preprocessor">  hashv += (hashv &lt;&lt; 3);                                                         \</span></div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span><span class="preprocessor">  hashv ^= (hashv &gt;&gt; 11);                                                        \</span></div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span><span class="preprocessor">  hashv += (hashv &lt;&lt; 15);                                                        \</span></div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span> </div>
<div class="foldopen" id="foldopen00551" data-start="" data-end="">
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"><a class="line" href="uthash_8h.html#a6d37144e54d2bd49eb88fbfd04c59dc5">  551</a></span><span class="preprocessor">#define HASH_JEN_MIX(a,b,c)                                                      \</span></div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span><span class="preprocessor">  a -= b; a -= c; a ^= ( c &gt;&gt; 13 );                                              \</span></div>
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span><span class="preprocessor">  b -= c; b -= a; b ^= ( a &lt;&lt; 8 );                                               \</span></div>
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span><span class="preprocessor">  c -= a; c -= b; c ^= ( b &gt;&gt; 13 );                                              \</span></div>
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span><span class="preprocessor">  a -= b; a -= c; a ^= ( c &gt;&gt; 12 );                                              \</span></div>
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span><span class="preprocessor">  b -= c; b -= a; b ^= ( a &lt;&lt; 16 );                                              \</span></div>
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span><span class="preprocessor">  c -= a; c -= b; c ^= ( b &gt;&gt; 5 );                                               \</span></div>
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span><span class="preprocessor">  a -= b; a -= c; a ^= ( c &gt;&gt; 3 );                                               \</span></div>
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span><span class="preprocessor">  b -= c; b -= a; b ^= ( a &lt;&lt; 10 );                                              \</span></div>
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span><span class="preprocessor">  c -= a; c -= b; c ^= ( b &gt;&gt; 15 );                                              \</span></div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span> </div>
<div class="foldopen" id="foldopen00564" data-start="" data-end="">
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"><a class="line" href="uthash_8h.html#a724ff23efd254654ac087ed60233c465">  564</a></span><span class="preprocessor">#define HASH_JEN(key,keylen,hashv)                                               \</span></div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span><span class="preprocessor">  unsigned _hj_i,_hj_j,_hj_k;                                                    \</span></div>
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span><span class="preprocessor">  unsigned const char *_hj_key=(unsigned const char*)(key);                      \</span></div>
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span><span class="preprocessor">  hashv = 0xfeedbeefu;                                                           \</span></div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span><span class="preprocessor">  _hj_i = _hj_j = 0x9e3779b9u;                                                   \</span></div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span><span class="preprocessor">  _hj_k = (unsigned)(keylen);                                                    \</span></div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span><span class="preprocessor">  while (_hj_k &gt;= 12U) {                                                         \</span></div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span><span class="preprocessor">    _hj_i +=    (_hj_key[0] + ( (unsigned)_hj_key[1] &lt;&lt; 8 )                      \</span></div>
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span><span class="preprocessor">        + ( (unsigned)_hj_key[2] &lt;&lt; 16 )                                         \</span></div>
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span><span class="preprocessor">        + ( (unsigned)_hj_key[3] &lt;&lt; 24 ) );                                      \</span></div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span><span class="preprocessor">    _hj_j +=    (_hj_key[4] + ( (unsigned)_hj_key[5] &lt;&lt; 8 )                      \</span></div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span><span class="preprocessor">        + ( (unsigned)_hj_key[6] &lt;&lt; 16 )                                         \</span></div>
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span><span class="preprocessor">        + ( (unsigned)_hj_key[7] &lt;&lt; 24 ) );                                      \</span></div>
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span><span class="preprocessor">    hashv += (_hj_key[8] + ( (unsigned)_hj_key[9] &lt;&lt; 8 )                         \</span></div>
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span><span class="preprocessor">        + ( (unsigned)_hj_key[10] &lt;&lt; 16 )                                        \</span></div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span><span class="preprocessor">        + ( (unsigned)_hj_key[11] &lt;&lt; 24 ) );                                     \</span></div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span><span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span><span class="preprocessor">     HASH_JEN_MIX(_hj_i, _hj_j, hashv);                                          \</span></div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span><span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span><span class="preprocessor">     _hj_key += 12;                                                              \</span></div>
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span><span class="preprocessor">     _hj_k -= 12U;                                                               \</span></div>
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span><span class="preprocessor">  hashv += (unsigned)(keylen);                                                   \</span></div>
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span><span class="preprocessor">  switch ( _hj_k ) {                                                             \</span></div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span><span class="preprocessor">    case 11: hashv += ( (unsigned)_hj_key[10] &lt;&lt; 24 ); </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span><span class="preprocessor">    case 10: hashv += ( (unsigned)_hj_key[9] &lt;&lt; 16 );  </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span><span class="preprocessor">    case 9:  hashv += ( (unsigned)_hj_key[8] &lt;&lt; 8 );   </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span><span class="preprocessor">    case 8:  _hj_j += ( (unsigned)_hj_key[7] &lt;&lt; 24 );  </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span><span class="preprocessor">    case 7:  _hj_j += ( (unsigned)_hj_key[6] &lt;&lt; 16 );  </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span><span class="preprocessor">    case 6:  _hj_j += ( (unsigned)_hj_key[5] &lt;&lt; 8 );   </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span><span class="preprocessor">    case 5:  _hj_j += _hj_key[4];                      </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span><span class="preprocessor">    case 4:  _hj_i += ( (unsigned)_hj_key[3] &lt;&lt; 24 );  </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span><span class="preprocessor">    case 3:  _hj_i += ( (unsigned)_hj_key[2] &lt;&lt; 16 );  </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span><span class="preprocessor">    case 2:  _hj_i += ( (unsigned)_hj_key[1] &lt;&lt; 8 );   </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor">         \</span></div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span><span class="preprocessor">    case 1:  _hj_i += _hj_key[0];                                                \</span></div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span><span class="preprocessor">    default: ;                                         </span><span class="comment">/* does not happen */</span><span class="preprocessor">     \</span></div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span><span class="preprocessor">  HASH_JEN_MIX(_hj_i, _hj_j, hashv);                                             \</span></div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span> </div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span><span class="comment">/* The Paul Hsieh hash function */</span></div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span><span class="preprocessor">#undef get16bits</span></div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span><span class="preprocessor">#if (defined(__GNUC__) &amp;&amp; defined(__i386__)) || defined(__WATCOMC__)             \</span></div>
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span><span class="preprocessor">  || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__)</span></div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span><span class="preprocessor">#define get16bits(d) (*((const uint16_t *) (d)))</span></div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span> </div>
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span><span class="preprocessor">#if !defined (get16bits)</span></div>
<div class="foldopen" id="foldopen00613" data-start="" data-end="">
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"><a class="line" href="uthash_8h.html#abc7d71657be8975a51684e41029b7964">  613</a></span><span class="preprocessor">#define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) &lt;&lt; 8)             \</span></div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span><span class="preprocessor">                       +(uint32_t)(((const uint8_t *)(d))[0]) )</span></div>
</div>
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span><span class="preprocessor">#endif</span></div>
<div class="foldopen" id="foldopen00616" data-start="" data-end="">
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"><a class="line" href="uthash_8h.html#a91480d6a21f082d49d20faeee0295cbb">  616</a></span><span class="preprocessor">#define HASH_SFH(key,keylen,hashv)                                               \</span></div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span><span class="preprocessor">  unsigned const char *_sfh_key=(unsigned const char*)(key);                     \</span></div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span><span class="preprocessor">  uint32_t _sfh_tmp, _sfh_len = (uint32_t)keylen;                                \</span></div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span><span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span><span class="preprocessor">  unsigned _sfh_rem = _sfh_len &amp; 3U;                                             \</span></div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span><span class="preprocessor">  _sfh_len &gt;&gt;= 2;                                                                \</span></div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span><span class="preprocessor">  hashv = 0xcafebabeu;                                                           \</span></div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span><span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span><span class="preprocessor">  </span><span class="comment">/* Main loop */</span><span class="preprocessor">                                                                \</span></div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span><span class="preprocessor">  for (;_sfh_len &gt; 0U; _sfh_len--) {                                             \</span></div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span><span class="preprocessor">    hashv    += get16bits (_sfh_key);                                            \</span></div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span><span class="preprocessor">    _sfh_tmp  = ((uint32_t)(get16bits (_sfh_key+2)) &lt;&lt; 11) ^ hashv;              \</span></div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span><span class="preprocessor">    hashv     = (hashv &lt;&lt; 16) ^ _sfh_tmp;                                        \</span></div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span><span class="preprocessor">    _sfh_key += 2U*sizeof (uint16_t);                                            \</span></div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span><span class="preprocessor">    hashv    += hashv &gt;&gt; 11;                                                     \</span></div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span><span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span><span class="preprocessor">  </span><span class="comment">/* Handle end cases */</span><span class="preprocessor">                                                         \</span></div>
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span><span class="preprocessor">  switch (_sfh_rem) {                                                            \</span></div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span><span class="preprocessor">    case 3: hashv += get16bits (_sfh_key);                                       \</span></div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span><span class="preprocessor">            hashv ^= hashv &lt;&lt; 16;                                                \</span></div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span><span class="preprocessor">            hashv ^= (uint32_t)(_sfh_key[sizeof (uint16_t)]) &lt;&lt; 18;              \</span></div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span><span class="preprocessor">            hashv += hashv &gt;&gt; 11;                                                \</span></div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span><span class="preprocessor">            break;                                                               \</span></div>
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span><span class="preprocessor">    case 2: hashv += get16bits (_sfh_key);                                       \</span></div>
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span><span class="preprocessor">            hashv ^= hashv &lt;&lt; 11;                                                \</span></div>
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span><span class="preprocessor">            hashv += hashv &gt;&gt; 17;                                                \</span></div>
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span><span class="preprocessor">            break;                                                               \</span></div>
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span><span class="preprocessor">    case 1: hashv += *_sfh_key;                                                  \</span></div>
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span><span class="preprocessor">            hashv ^= hashv &lt;&lt; 10;                                                \</span></div>
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span><span class="preprocessor">            hashv += hashv &gt;&gt; 1;                                                 \</span></div>
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span><span class="preprocessor">                                                                                 \</span></div>
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span><span class="preprocessor">  </span><span class="comment">/* Force &quot;avalanching&quot; of final 127 bits */</span><span class="preprocessor">                                    \</span></div>
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span><span class="preprocessor">  hashv ^= hashv &lt;&lt; 3;                                                           \</span></div>
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span><span class="preprocessor">  hashv += hashv &gt;&gt; 5;                                                           \</span></div>
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span><span class="preprocessor">  hashv ^= hashv &lt;&lt; 4;                                                           \</span></div>
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span><span class="preprocessor">  hashv += hashv &gt;&gt; 17;                                                          \</span></div>
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span><span class="preprocessor">  hashv ^= hashv &lt;&lt; 25;                                                          \</span></div>
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span><span class="preprocessor">  hashv += hashv &gt;&gt; 6;                                                           \</span></div>
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span> </div>
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span><span class="preprocessor">#ifdef HASH_USING_NO_STRICT_ALIASING</span></div>
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span><span class="comment">/* The MurmurHash exploits some CPU&#39;s (x86,x86_64) tolerance for unaligned reads.</span></div>
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span><span class="comment"> * For other types of CPU&#39;s (e.g. Sparc) an unaligned read causes a bus error.</span></div>
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span><span class="comment"> * MurmurHash uses the faster approach only on CPU&#39;s where we know it&#39;s safe.</span></div>
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span><span class="comment"> *</span></div>
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span><span class="comment"> * Note the preprocessor built-in defines can be emitted using:</span></div>
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span><span class="comment"> *</span></div>
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span><span class="comment"> *   gcc -m64 -dM -E - &lt; /dev/null                  (on gcc)</span></div>
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span><span class="comment"> *   cc -## a.c (where a.c is a simple test file)   (Sun Studio)</span></div>
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span><span class="comment"> */</span></div>
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span><span class="preprocessor">#if (defined(__i386__) || defined(__x86_64__)  || defined(_M_IX86))</span></div>
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span><span class="preprocessor">#define MUR_GETBLOCK(p,i) p[i]</span></div>
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span><span class="preprocessor">#else </span><span class="comment">/* non intel */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span><span class="preprocessor">#define MUR_PLUS0_ALIGNED(p) (((unsigned long)p &amp; 3UL) == 0UL)</span></div>
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span><span class="preprocessor">#define MUR_PLUS1_ALIGNED(p) (((unsigned long)p &amp; 3UL) == 1UL)</span></div>
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span><span class="preprocessor">#define MUR_PLUS2_ALIGNED(p) (((unsigned long)p &amp; 3UL) == 2UL)</span></div>
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span><span class="preprocessor">#define MUR_PLUS3_ALIGNED(p) (((unsigned long)p &amp; 3UL) == 3UL)</span></div>
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span><span class="preprocessor">#define WP(p) ((uint32_t*)((unsigned long)(p) &amp; ~3UL))</span></div>
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span><span class="preprocessor">#if (defined(__BIG_ENDIAN__) || defined(SPARC) || defined(__ppc__) || defined(__ppc64__))</span></div>
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span><span class="preprocessor">#define MUR_THREE_ONE(p) ((((*WP(p))&amp;0x00ffffff) &lt;&lt; 8) | (((*(WP(p)+1))&amp;0xff000000) &gt;&gt; 24))</span></div>
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span><span class="preprocessor">#define MUR_TWO_TWO(p)   ((((*WP(p))&amp;0x0000ffff) &lt;&lt;16) | (((*(WP(p)+1))&amp;0xffff0000) &gt;&gt; 16))</span></div>
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span><span class="preprocessor">#define MUR_ONE_THREE(p) ((((*WP(p))&amp;0x000000ff) &lt;&lt;24) | (((*(WP(p)+1))&amp;0xffffff00) &gt;&gt;  8))</span></div>
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span><span class="preprocessor">#else </span><span class="comment">/* assume little endian non-intel */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span><span class="preprocessor">#define MUR_THREE_ONE(p) ((((*WP(p))&amp;0xffffff00) &gt;&gt; 8) | (((*(WP(p)+1))&amp;0x000000ff) &lt;&lt; 24))</span></div>
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span><span class="preprocessor">#define MUR_TWO_TWO(p)   ((((*WP(p))&amp;0xffff0000) &gt;&gt;16) | (((*(WP(p)+1))&amp;0x0000ffff) &lt;&lt; 16))</span></div>
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span><span class="preprocessor">#define MUR_ONE_THREE(p) ((((*WP(p))&amp;0xff000000) &gt;&gt;24) | (((*(WP(p)+1))&amp;0x00ffffff) &lt;&lt;  8))</span></div>
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span><span class="preprocessor">#define MUR_GETBLOCK(p,i) (MUR_PLUS0_ALIGNED(p) ? ((p)[i]) :           \</span></div>
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span><span class="preprocessor">                            (MUR_PLUS1_ALIGNED(p) ? MUR_THREE_ONE(p) : \</span></div>
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span><span class="preprocessor">                             (MUR_PLUS2_ALIGNED(p) ? MUR_TWO_TWO(p) :  \</span></div>
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span><span class="preprocessor">                                                      MUR_ONE_THREE(p))))</span></div>
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span><span class="preprocessor">#define MUR_ROTL32(x,r) (((x) &lt;&lt; (r)) | ((x) &gt;&gt; (32 - (r))))</span></div>
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span><span class="preprocessor">#define MUR_FMIX(_h) \</span></div>
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span><span class="preprocessor">do {                 \</span></div>
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span><span class="preprocessor">  _h ^= _h &gt;&gt; 16;    \</span></div>
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span><span class="preprocessor">  _h *= 0x85ebca6bu; \</span></div>
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span><span class="preprocessor">  _h ^= _h &gt;&gt; 13;    \</span></div>
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span><span class="preprocessor">  _h *= 0xc2b2ae35u; \</span></div>
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span><span class="preprocessor">  _h ^= _h &gt;&gt; 16;    \</span></div>
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span> </div>
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span><span class="preprocessor">#define HASH_MUR(key,keylen,hashv)                                     \</span></div>
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span><span class="preprocessor">do {                                                                   \</span></div>
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span><span class="preprocessor">  const uint8_t *_mur_data = (const uint8_t*)(key);                    \</span></div>
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span><span class="preprocessor">  const int _mur_nblocks = (int)(keylen) / 4;                          \</span></div>
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span><span class="preprocessor">  uint32_t _mur_h1 = 0xf88D5353u;                                      \</span></div>
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span><span class="preprocessor">  uint32_t _mur_c1 = 0xcc9e2d51u;                                      \</span></div>
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span><span class="preprocessor">  uint32_t _mur_c2 = 0x1b873593u;                                      \</span></div>
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span><span class="preprocessor">  uint32_t _mur_k1 = 0;                                                \</span></div>
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span><span class="preprocessor">  const uint8_t *_mur_tail;                                            \</span></div>
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span><span class="preprocessor">  const uint32_t *_mur_blocks = (const uint32_t*)(_mur_data+(_mur_nblocks*4)); \</span></div>
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span><span class="preprocessor">  int _mur_i;                                                          \</span></div>
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span><span class="preprocessor">  for (_mur_i = -_mur_nblocks; _mur_i != 0; _mur_i++) {                \</span></div>
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span><span class="preprocessor">    _mur_k1 = MUR_GETBLOCK(_mur_blocks,_mur_i);                        \</span></div>
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span><span class="preprocessor">    _mur_k1 *= _mur_c1;                                                \</span></div>
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span><span class="preprocessor">    _mur_k1 = MUR_ROTL32(_mur_k1,15);                                  \</span></div>
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span><span class="preprocessor">    _mur_k1 *= _mur_c2;                                                \</span></div>
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span><span class="preprocessor">                                                                       \</span></div>
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span><span class="preprocessor">    _mur_h1 ^= _mur_k1;                                                \</span></div>
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span><span class="preprocessor">    _mur_h1 = MUR_ROTL32(_mur_h1,13);                                  \</span></div>
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span><span class="preprocessor">    _mur_h1 = (_mur_h1*5U) + 0xe6546b64u;                              \</span></div>
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span><span class="preprocessor">  }                                                                    \</span></div>
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span><span class="preprocessor">  _mur_tail = (const uint8_t*)(_mur_data + (_mur_nblocks*4));          \</span></div>
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span><span class="preprocessor">  _mur_k1=0;                                                           \</span></div>
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span><span class="preprocessor">  switch ((keylen) &amp; 3U) {                                             \</span></div>
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span><span class="preprocessor">    case 0: break;                                                     \</span></div>
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span><span class="preprocessor">    case 3: _mur_k1 ^= (uint32_t)_mur_tail[2] &lt;&lt; 16; </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor"> \</span></div>
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span><span class="preprocessor">    case 2: _mur_k1 ^= (uint32_t)_mur_tail[1] &lt;&lt; 8;  </span><span class="comment">/* FALLTHROUGH */</span><span class="preprocessor"> \</span></div>
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span><span class="preprocessor">    case 1: _mur_k1 ^= (uint32_t)_mur_tail[0];                         \</span></div>
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span><span class="preprocessor">    _mur_k1 *= _mur_c1;                                                \</span></div>
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span><span class="preprocessor">    _mur_k1 = MUR_ROTL32(_mur_k1,15);                                  \</span></div>
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span><span class="preprocessor">    _mur_k1 *= _mur_c2;                                                \</span></div>
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span><span class="preprocessor">    _mur_h1 ^= _mur_k1;                                                \</span></div>
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span><span class="preprocessor">  }                                                                    \</span></div>
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span><span class="preprocessor">  _mur_h1 ^= (uint32_t)(keylen);                                       \</span></div>
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span><span class="preprocessor">  MUR_FMIX(_mur_h1);                                                   \</span></div>
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span><span class="preprocessor">  hashv = _mur_h1;                                                     \</span></div>
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span><span class="preprocessor">} while (0)</span></div>
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span><span class="preprocessor">#endif  </span><span class="comment">/* HASH_USING_NO_STRICT_ALIASING */</span><span class="preprocessor"></span></div>
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span> </div>
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span><span class="comment">/* iterate over items in a known bucket to find desired item */</span></div>
<div class="foldopen" id="foldopen00741" data-start="" data-end="">
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"><a class="line" href="uthash_8h.html#a54951c7b798e8da9931d2b607e97b619">  741</a></span><span class="preprocessor">#define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,hashval,out)               \</span></div>
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span><span class="preprocessor">  if ((head).hh_head != NULL) {                                                  \</span></div>
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span><span class="preprocessor">    DECLTYPE_ASSIGN(out, ELMT_FROM_HH(tbl, (head).hh_head));                     \</span></div>
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span><span class="preprocessor">  } else {                                                                       \</span></div>
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span><span class="preprocessor">    (out) = NULL;                                                                \</span></div>
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span><span class="preprocessor">  while ((out) != NULL) {                                                        \</span></div>
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span><span class="preprocessor">    if ((out)-&gt;hh.hashv == (hashval) &amp;&amp; (out)-&gt;hh.keylen == (keylen_in)) {       \</span></div>
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span><span class="preprocessor">      if (uthash_memcmp((out)-&gt;hh.key, keyptr, keylen_in) == 0) {                \</span></div>
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span><span class="preprocessor">        break;                                                                   \</span></div>
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span><span class="preprocessor">    if ((out)-&gt;hh.hh_next != NULL) {                                             \</span></div>
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span><span class="preprocessor">      DECLTYPE_ASSIGN(out, ELMT_FROM_HH(tbl, (out)-&gt;hh.hh_next));                \</span></div>
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span><span class="preprocessor">    } else {                                                                     \</span></div>
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span><span class="preprocessor">      (out) = NULL;                                                              \</span></div>
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span> </div>
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span><span class="comment">/* add an item to a bucket  */</span></div>
<div class="foldopen" id="foldopen00763" data-start="" data-end="">
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"><a class="line" href="uthash_8h.html#a78e11adee321f45c5cb31ff2d6eb0348">  763</a></span><span class="preprocessor">#define HASH_ADD_TO_BKT(head,addhh)                                              \</span></div>
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span><span class="preprocessor">  UT_hash_bucket *_ha_head = &amp;(head);                                            \</span></div>
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span><span class="preprocessor">  _ha_head-&gt;count++;                                                             \</span></div>
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span><span class="preprocessor">  (addhh)-&gt;hh_next = _ha_head-&gt;hh_head;                                          \</span></div>
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span><span class="preprocessor">  (addhh)-&gt;hh_prev = NULL;                                                       \</span></div>
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span><span class="preprocessor">  if (_ha_head-&gt;hh_head != NULL) {                                               \</span></div>
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span><span class="preprocessor">    _ha_head-&gt;hh_head-&gt;hh_prev = (addhh);                                        \</span></div>
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno">  772</span><span class="preprocessor">  _ha_head-&gt;hh_head = (addhh);                                                   \</span></div>
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span><span class="preprocessor">  if ((_ha_head-&gt;count &gt;= ((_ha_head-&gt;expand_mult + 1U) * HASH_BKT_CAPACITY_THRESH)) \</span></div>
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span><span class="preprocessor">      &amp;&amp; !(addhh)-&gt;tbl-&gt;noexpand) {                                              \</span></div>
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span><span class="preprocessor">    HASH_EXPAND_BUCKETS((addhh)-&gt;tbl);                                           \</span></div>
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span> </div>
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span><span class="comment">/* remove an item from a given bucket */</span></div>
<div class="foldopen" id="foldopen00780" data-start="" data-end="">
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"><a class="line" href="uthash_8h.html#a1df38274f20925d2cb309f7a4c7a165e">  780</a></span><span class="preprocessor">#define HASH_DEL_IN_BKT(head,delhh)                                              \</span></div>
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span><span class="preprocessor">  UT_hash_bucket *_hd_head = &amp;(head);                                            \</span></div>
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span><span class="preprocessor">  _hd_head-&gt;count--;                                                             \</span></div>
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span><span class="preprocessor">  if (_hd_head-&gt;hh_head == (delhh)) {                                            \</span></div>
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span><span class="preprocessor">    _hd_head-&gt;hh_head = (delhh)-&gt;hh_next;                                        \</span></div>
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span><span class="preprocessor">  if ((delhh)-&gt;hh_prev) {                                                        \</span></div>
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span><span class="preprocessor">    (delhh)-&gt;hh_prev-&gt;hh_next = (delhh)-&gt;hh_next;                                \</span></div>
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span><span class="preprocessor">  if ((delhh)-&gt;hh_next) {                                                        \</span></div>
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span><span class="preprocessor">    (delhh)-&gt;hh_next-&gt;hh_prev = (delhh)-&gt;hh_prev;                                \</span></div>
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span> </div>
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span><span class="comment">/* Bucket expansion has the effect of doubling the number of buckets</span></div>
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span><span class="comment"> * and redistributing the items into the new buckets. Ideally the</span></div>
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span><span class="comment"> * items will distribute more or less evenly into the new buckets</span></div>
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span><span class="comment"> * (the extent to which this is true is a measure of the quality of</span></div>
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span><span class="comment"> * the hash function as it applies to the key domain).</span></div>
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span><span class="comment"> *</span></div>
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span><span class="comment"> * With the items distributed into more buckets, the chain length</span></div>
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span><span class="comment"> * (item count) in each bucket is reduced. Thus by expanding buckets</span></div>
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span><span class="comment"> * the hash keeps a bound on the chain length. This bounded chain</span></div>
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span><span class="comment"> * length is the essence of how a hash provides constant time lookup.</span></div>
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span><span class="comment"> *</span></div>
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span><span class="comment"> * The calculation of tbl-&gt;ideal_chain_maxlen below deserves some</span></div>
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span><span class="comment"> * explanation. First, keep in mind that we&#39;re calculating the ideal</span></div>
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span><span class="comment"> * maximum chain length based on the *new* (doubled) bucket count.</span></div>
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span><span class="comment"> * In fractions this is just n/b (n=number of items,b=new num buckets).</span></div>
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span><span class="comment"> * Since the ideal chain length is an integer, we want to calculate</span></div>
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span><span class="comment"> * ceil(n/b). We don&#39;t depend on floating point arithmetic in this</span></div>
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span><span class="comment"> * hash, so to calculate ceil(n/b) with integers we could write</span></div>
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span><span class="comment"> *</span></div>
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span><span class="comment"> *      ceil(n/b) = (n/b) + ((n%b)?1:0)</span></div>
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span><span class="comment"> *</span></div>
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span><span class="comment"> * and in fact a previous version of this hash did just that.</span></div>
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span><span class="comment"> * But now we have improved things a bit by recognizing that b is</span></div>
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span><span class="comment"> * always a power of two. We keep its base 2 log handy (call it lb),</span></div>
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span><span class="comment"> * so now we can write this with a bit shift and logical AND:</span></div>
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span><span class="comment"> *</span></div>
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span><span class="comment"> *      ceil(n/b) = (n&gt;&gt;lb) + ( (n &amp; (b-1)) ? 1:0)</span></div>
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span><span class="comment"> *</span></div>
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span><span class="comment"> */</span></div>
<div class="foldopen" id="foldopen00824" data-start="" data-end="">
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"><a class="line" href="uthash_8h.html#a6439fd6271474e61b1840fbf83132f03">  824</a></span><span class="preprocessor">#define HASH_EXPAND_BUCKETS(tbl)                                                 \</span></div>
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span><span class="preprocessor">  unsigned _he_bkt;                                                              \</span></div>
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span><span class="preprocessor">  unsigned _he_bkt_i;                                                            \</span></div>
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span><span class="preprocessor">  struct UT_hash_handle *_he_thh, *_he_hh_nxt;                                   \</span></div>
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span><span class="preprocessor">  UT_hash_bucket *_he_new_buckets, *_he_newbkt;                                  \</span></div>
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span><span class="preprocessor">  _he_new_buckets = (UT_hash_bucket*)uthash_malloc(                              \</span></div>
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span><span class="preprocessor">           2UL * (tbl)-&gt;num_buckets * sizeof(struct UT_hash_bucket));            \</span></div>
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span><span class="preprocessor">  if (!_he_new_buckets) {                                                        \</span></div>
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span><span class="preprocessor">    uthash_fatal(&quot;out of memory&quot;);                                               \</span></div>
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span><span class="preprocessor">  uthash_bzero(_he_new_buckets,                                                  \</span></div>
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span><span class="preprocessor">          2UL * (tbl)-&gt;num_buckets * sizeof(struct UT_hash_bucket));             \</span></div>
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span><span class="preprocessor">  (tbl)-&gt;ideal_chain_maxlen =                                                    \</span></div>
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span><span class="preprocessor">     ((tbl)-&gt;num_items &gt;&gt; ((tbl)-&gt;log2_num_buckets+1U)) +                        \</span></div>
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span><span class="preprocessor">     ((((tbl)-&gt;num_items &amp; (((tbl)-&gt;num_buckets*2U)-1U)) != 0U) ? 1U : 0U);      \</span></div>
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span><span class="preprocessor">  (tbl)-&gt;nonideal_items = 0;                                                     \</span></div>
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span><span class="preprocessor">  for (_he_bkt_i = 0; _he_bkt_i &lt; (tbl)-&gt;num_buckets; _he_bkt_i++) {             \</span></div>
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span><span class="preprocessor">    _he_thh = (tbl)-&gt;buckets[ _he_bkt_i ].hh_head;                               \</span></div>
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span><span class="preprocessor">    while (_he_thh != NULL) {                                                    \</span></div>
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno">  844</span><span class="preprocessor">      _he_hh_nxt = _he_thh-&gt;hh_next;                                             \</span></div>
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span><span class="preprocessor">      HASH_TO_BKT(_he_thh-&gt;hashv, (tbl)-&gt;num_buckets * 2U, _he_bkt);             \</span></div>
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span><span class="preprocessor">      _he_newbkt = &amp;(_he_new_buckets[_he_bkt]);                                  \</span></div>
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span><span class="preprocessor">      if (++(_he_newbkt-&gt;count) &gt; (tbl)-&gt;ideal_chain_maxlen) {                   \</span></div>
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span><span class="preprocessor">        (tbl)-&gt;nonideal_items++;                                                 \</span></div>
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span><span class="preprocessor">        _he_newbkt-&gt;expand_mult = _he_newbkt-&gt;count / (tbl)-&gt;ideal_chain_maxlen; \</span></div>
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span><span class="preprocessor">      _he_thh-&gt;hh_prev = NULL;                                                   \</span></div>
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span><span class="preprocessor">      _he_thh-&gt;hh_next = _he_newbkt-&gt;hh_head;                                    \</span></div>
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span><span class="preprocessor">      if (_he_newbkt-&gt;hh_head != NULL) {                                         \</span></div>
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span><span class="preprocessor">        _he_newbkt-&gt;hh_head-&gt;hh_prev = _he_thh;                                  \</span></div>
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno">  856</span><span class="preprocessor">      _he_newbkt-&gt;hh_head = _he_thh;                                             \</span></div>
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span><span class="preprocessor">      _he_thh = _he_hh_nxt;                                                      \</span></div>
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span><span class="preprocessor">  uthash_free((tbl)-&gt;buckets, (tbl)-&gt;num_buckets * sizeof(struct UT_hash_bucket)); \</span></div>
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span><span class="preprocessor">  (tbl)-&gt;num_buckets *= 2U;                                                      \</span></div>
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span><span class="preprocessor">  (tbl)-&gt;log2_num_buckets++;                                                     \</span></div>
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span><span class="preprocessor">  (tbl)-&gt;buckets = _he_new_buckets;                                              \</span></div>
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span><span class="preprocessor">  (tbl)-&gt;ineff_expands = ((tbl)-&gt;nonideal_items &gt; ((tbl)-&gt;num_items &gt;&gt; 1)) ?     \</span></div>
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno">  865</span><span class="preprocessor">      ((tbl)-&gt;ineff_expands+1U) : 0U;                                            \</span></div>
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno">  866</span><span class="preprocessor">  if ((tbl)-&gt;ineff_expands &gt; 1U) {                                               \</span></div>
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span><span class="preprocessor">    (tbl)-&gt;noexpand = 1;                                                         \</span></div>
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span><span class="preprocessor">    uthash_noexpand_fyi(tbl);                                                    \</span></div>
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span><span class="preprocessor">  uthash_expand_fyi(tbl);                                                        \</span></div>
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span> </div>
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span> </div>
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span><span class="comment">/* This is an adaptation of Simon Tatham&#39;s O(n log(n)) mergesort */</span></div>
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span><span class="comment">/* Note that HASH_SORT assumes the hash handle name to be hh.</span></div>
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span><span class="comment"> * HASH_SRT was added to allow the hash handle name to be passed in. */</span></div>
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"><a class="line" href="uthash_8h.html#a88d2ab40956878caacd02c214f7e8f15">  877</a></span><span class="preprocessor">#define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn)</span></div>
<div class="foldopen" id="foldopen00878" data-start="" data-end="">
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"><a class="line" href="uthash_8h.html#a388b4071dcff005154f431d3d3025fbd">  878</a></span><span class="preprocessor">#define HASH_SRT(hh,head,cmpfcn)                                                 \</span></div>
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno">  880</span><span class="preprocessor">  unsigned _hs_i;                                                                \</span></div>
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span><span class="preprocessor">  unsigned _hs_looping,_hs_nmerges,_hs_insize,_hs_psize,_hs_qsize;               \</span></div>
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span><span class="preprocessor">  struct UT_hash_handle *_hs_p, *_hs_q, *_hs_e, *_hs_list, *_hs_tail;            \</span></div>
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno">  883</span><span class="preprocessor">  if (head != NULL) {                                                            \</span></div>
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span><span class="preprocessor">    _hs_insize = 1;                                                              \</span></div>
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno">  885</span><span class="preprocessor">    _hs_looping = 1;                                                             \</span></div>
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span><span class="preprocessor">    _hs_list = &amp;((head)-&gt;hh);                                                    \</span></div>
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno">  887</span><span class="preprocessor">    while (_hs_looping != 0U) {                                                  \</span></div>
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno">  888</span><span class="preprocessor">      _hs_p = _hs_list;                                                          \</span></div>
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno">  889</span><span class="preprocessor">      _hs_list = NULL;                                                           \</span></div>
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span><span class="preprocessor">      _hs_tail = NULL;                                                           \</span></div>
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span><span class="preprocessor">      _hs_nmerges = 0;                                                           \</span></div>
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span><span class="preprocessor">      while (_hs_p != NULL) {                                                    \</span></div>
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno">  893</span><span class="preprocessor">        _hs_nmerges++;                                                           \</span></div>
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno">  894</span><span class="preprocessor">        _hs_q = _hs_p;                                                           \</span></div>
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno">  895</span><span class="preprocessor">        _hs_psize = 0;                                                           \</span></div>
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span><span class="preprocessor">        for (_hs_i = 0; _hs_i &lt; _hs_insize; ++_hs_i) {                           \</span></div>
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span><span class="preprocessor">          _hs_psize++;                                                           \</span></div>
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span><span class="preprocessor">          _hs_q = ((_hs_q-&gt;next != NULL) ?                                       \</span></div>
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span><span class="preprocessor">            HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_q-&gt;next) : NULL);                   \</span></div>
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span><span class="preprocessor">          if (_hs_q == NULL) {                                                   \</span></div>
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno">  901</span><span class="preprocessor">            break;                                                               \</span></div>
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno">  902</span><span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span><span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span><span class="preprocessor">        _hs_qsize = _hs_insize;                                                  \</span></div>
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span><span class="preprocessor">        while ((_hs_psize != 0U) || ((_hs_qsize != 0U) &amp;&amp; (_hs_q != NULL))) {    \</span></div>
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span><span class="preprocessor">          if (_hs_psize == 0U) {                                                 \</span></div>
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span><span class="preprocessor">            _hs_e = _hs_q;                                                       \</span></div>
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span><span class="preprocessor">            _hs_q = ((_hs_q-&gt;next != NULL) ?                                     \</span></div>
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span><span class="preprocessor">              HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_q-&gt;next) : NULL);                 \</span></div>
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span><span class="preprocessor">            _hs_qsize--;                                                         \</span></div>
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span><span class="preprocessor">          } else if ((_hs_qsize == 0U) || (_hs_q == NULL)) {                     \</span></div>
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span><span class="preprocessor">            _hs_e = _hs_p;                                                       \</span></div>
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span><span class="preprocessor">            if (_hs_p != NULL) {                                                 \</span></div>
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</span><span class="preprocessor">              _hs_p = ((_hs_p-&gt;next != NULL) ?                                   \</span></div>
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span><span class="preprocessor">                HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_p-&gt;next) : NULL);               \</span></div>
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span><span class="preprocessor">            }                                                                    \</span></div>
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span><span class="preprocessor">            _hs_psize--;                                                         \</span></div>
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span><span class="preprocessor">          } else if ((cmpfcn(                                                    \</span></div>
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span><span class="preprocessor">                DECLTYPE(head)(ELMT_FROM_HH((head)-&gt;hh.tbl, _hs_p)),             \</span></div>
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span><span class="preprocessor">                DECLTYPE(head)(ELMT_FROM_HH((head)-&gt;hh.tbl, _hs_q))              \</span></div>
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno">  921</span><span class="preprocessor">                )) &lt;= 0) {                                                       \</span></div>
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span><span class="preprocessor">            _hs_e = _hs_p;                                                       \</span></div>
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span><span class="preprocessor">            if (_hs_p != NULL) {                                                 \</span></div>
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span><span class="preprocessor">              _hs_p = ((_hs_p-&gt;next != NULL) ?                                   \</span></div>
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno">  925</span><span class="preprocessor">                HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_p-&gt;next) : NULL);               \</span></div>
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span><span class="preprocessor">            }                                                                    \</span></div>
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span><span class="preprocessor">            _hs_psize--;                                                         \</span></div>
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno">  928</span><span class="preprocessor">          } else {                                                               \</span></div>
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span><span class="preprocessor">            _hs_e = _hs_q;                                                       \</span></div>
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span><span class="preprocessor">            _hs_q = ((_hs_q-&gt;next != NULL) ?                                     \</span></div>
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span><span class="preprocessor">              HH_FROM_ELMT((head)-&gt;hh.tbl, _hs_q-&gt;next) : NULL);                 \</span></div>
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span><span class="preprocessor">            _hs_qsize--;                                                         \</span></div>
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno">  933</span><span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span><span class="preprocessor">          if ( _hs_tail != NULL ) {                                              \</span></div>
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno">  935</span><span class="preprocessor">            _hs_tail-&gt;next = ((_hs_e != NULL) ?                                  \</span></div>
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span><span class="preprocessor">              ELMT_FROM_HH((head)-&gt;hh.tbl, _hs_e) : NULL);                       \</span></div>
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span><span class="preprocessor">          } else {                                                               \</span></div>
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span><span class="preprocessor">            _hs_list = _hs_e;                                                    \</span></div>
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span><span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span><span class="preprocessor">          if (_hs_e != NULL) {                                                   \</span></div>
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span><span class="preprocessor">            _hs_e-&gt;prev = ((_hs_tail != NULL) ?                                  \</span></div>
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span><span class="preprocessor">              ELMT_FROM_HH((head)-&gt;hh.tbl, _hs_tail) : NULL);                    \</span></div>
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span><span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span><span class="preprocessor">          _hs_tail = _hs_e;                                                      \</span></div>
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span><span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span><span class="preprocessor">        _hs_p = _hs_q;                                                           \</span></div>
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno">  947</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span><span class="preprocessor">      if (_hs_tail != NULL) {                                                    \</span></div>
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span><span class="preprocessor">        _hs_tail-&gt;next = NULL;                                                   \</span></div>
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span><span class="preprocessor">      if (_hs_nmerges &lt;= 1U) {                                                   \</span></div>
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span><span class="preprocessor">        _hs_looping = 0;                                                         \</span></div>
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span><span class="preprocessor">        (head)-&gt;hh.tbl-&gt;tail = _hs_tail;                                         \</span></div>
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span><span class="preprocessor">        DECLTYPE_ASSIGN(head, ELMT_FROM_HH((head)-&gt;hh.tbl, _hs_list));           \</span></div>
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno">  956</span><span class="preprocessor">      _hs_insize *= 2U;                                                          \</span></div>
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno">  958</span><span class="preprocessor">    HASH_FSCK(hh, head, &quot;HASH_SRT&quot;);                                             \</span></div>
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span> </div>
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span><span class="comment">/* This function selects items from one hash into another hash.</span></div>
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno">  963</span><span class="comment"> * The end result is that the selected items have dual presence</span></div>
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno">  964</span><span class="comment"> * in both hashes. There is no copy of the items made; rather</span></div>
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno">  965</span><span class="comment"> * they are added into the new hash through a secondary hash</span></div>
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span><span class="comment"> * hash handle that must be present in the structure. */</span></div>
<div class="foldopen" id="foldopen00967" data-start="" data-end="">
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno"><a class="line" href="uthash_8h.html#ad190366f7a476ece79bd628240a5fc93">  967</a></span><span class="preprocessor">#define HASH_SELECT(hh_dst, dst, hh_src, src, cond)                              \</span></div>
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span><span class="preprocessor">  unsigned _src_bkt, _dst_bkt;                                                   \</span></div>
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno">  970</span><span class="preprocessor">  void *_last_elt = NULL, *_elt;                                                 \</span></div>
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span><span class="preprocessor">  UT_hash_handle *_src_hh, *_dst_hh, *_last_elt_hh=NULL;                         \</span></div>
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span><span class="preprocessor">  ptrdiff_t _dst_hho = ((char*)(&amp;(dst)-&gt;hh_dst) - (char*)(dst));                 \</span></div>
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span><span class="preprocessor">  if ((src) != NULL) {                                                           \</span></div>
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span><span class="preprocessor">    for (_src_bkt=0; _src_bkt &lt; (src)-&gt;hh_src.tbl-&gt;num_buckets; _src_bkt++) {    \</span></div>
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span><span class="preprocessor">      for (_src_hh = (src)-&gt;hh_src.tbl-&gt;buckets[_src_bkt].hh_head;               \</span></div>
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span><span class="preprocessor">        _src_hh != NULL;                                                         \</span></div>
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span><span class="preprocessor">        _src_hh = _src_hh-&gt;hh_next) {                                            \</span></div>
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span><span class="preprocessor">        _elt = ELMT_FROM_HH((src)-&gt;hh_src.tbl, _src_hh);                         \</span></div>
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span><span class="preprocessor">        if (cond(_elt)) {                                                        \</span></div>
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span><span class="preprocessor">          _dst_hh = (UT_hash_handle*)(((char*)_elt) + _dst_hho);                 \</span></div>
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span><span class="preprocessor">          _dst_hh-&gt;key = _src_hh-&gt;key;                                           \</span></div>
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span><span class="preprocessor">          _dst_hh-&gt;keylen = _src_hh-&gt;keylen;                                     \</span></div>
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span><span class="preprocessor">          _dst_hh-&gt;hashv = _src_hh-&gt;hashv;                                       \</span></div>
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno">  984</span><span class="preprocessor">          _dst_hh-&gt;prev = _last_elt;                                             \</span></div>
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span><span class="preprocessor">          _dst_hh-&gt;next = NULL;                                                  \</span></div>
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span><span class="preprocessor">          if (_last_elt_hh != NULL) {                                            \</span></div>
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span><span class="preprocessor">            _last_elt_hh-&gt;next = _elt;                                           \</span></div>
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span><span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span><span class="preprocessor">          if ((dst) == NULL) {                                                   \</span></div>
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span><span class="preprocessor">            DECLTYPE_ASSIGN(dst, _elt);                                          \</span></div>
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span><span class="preprocessor">            HASH_MAKE_TABLE(hh_dst, dst);                                        \</span></div>
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span><span class="preprocessor">          } else {                                                               \</span></div>
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span><span class="preprocessor">            _dst_hh-&gt;tbl = (dst)-&gt;hh_dst.tbl;                                    \</span></div>
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span><span class="preprocessor">          }                                                                      \</span></div>
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span><span class="preprocessor">          HASH_TO_BKT(_dst_hh-&gt;hashv, _dst_hh-&gt;tbl-&gt;num_buckets, _dst_bkt);      \</span></div>
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span><span class="preprocessor">          HASH_ADD_TO_BKT(_dst_hh-&gt;tbl-&gt;buckets[_dst_bkt], _dst_hh);             \</span></div>
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span><span class="preprocessor">          HASH_BLOOM_ADD(_dst_hh-&gt;tbl, _dst_hh-&gt;hashv);                          \</span></div>
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span><span class="preprocessor">          (dst)-&gt;hh_dst.tbl-&gt;num_items++;                                        \</span></div>
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span><span class="preprocessor">          _last_elt = _elt;                                                      \</span></div>
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span><span class="preprocessor">          _last_elt_hh = _dst_hh;                                                \</span></div>
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span><span class="preprocessor">        }                                                                        \</span></div>
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span><span class="preprocessor">      }                                                                          \</span></div>
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span><span class="preprocessor">    }                                                                            \</span></div>
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span><span class="preprocessor">  HASH_FSCK(hh_dst, dst, &quot;HASH_SELECT&quot;);                                         \</span></div>
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> </div>
<div class="foldopen" id="foldopen01008" data-start="" data-end="">
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"><a class="line" href="uthash_8h.html#a0512b3f7a824275579ec82643ef2cc23"> 1008</a></span><span class="preprocessor">#define HASH_CLEAR(hh,head)                                                      \</span></div>
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span><span class="preprocessor">do {                                                                             \</span></div>
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span><span class="preprocessor">  if ((head) != NULL) {                                                          \</span></div>
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span><span class="preprocessor">    HASH_BLOOM_FREE((head)-&gt;hh.tbl);                                             \</span></div>
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span><span class="preprocessor">    uthash_free((head)-&gt;hh.tbl-&gt;buckets,                                         \</span></div>
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span><span class="preprocessor">                (head)-&gt;hh.tbl-&gt;num_buckets*sizeof(struct UT_hash_bucket));      \</span></div>
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span><span class="preprocessor">    uthash_free((head)-&gt;hh.tbl, sizeof(UT_hash_table));                          \</span></div>
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span><span class="preprocessor">    (head) = NULL;                                                               \</span></div>
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span><span class="preprocessor">  }                                                                              \</span></div>
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span><span class="preprocessor">} while (0)</span></div>
</div>
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> </div>
<div class="foldopen" id="foldopen01019" data-start="" data-end="">
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"><a class="line" href="uthash_8h.html#ab35e223d7385dfbe3c42758f502f4c04"> 1019</a></span><span class="preprocessor">#define HASH_OVERHEAD(hh,head)                                                   \</span></div>
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span><span class="preprocessor"> (((head) != NULL) ? (                                                           \</span></div>
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span><span class="preprocessor"> (size_t)(((head)-&gt;hh.tbl-&gt;num_items   * sizeof(UT_hash_handle))   +             \</span></div>
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span><span class="preprocessor">          ((head)-&gt;hh.tbl-&gt;num_buckets * sizeof(UT_hash_bucket))   +             \</span></div>
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span><span class="preprocessor">           sizeof(UT_hash_table)                                   +             \</span></div>
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span><span class="preprocessor">           (HASH_BLOOM_BYTELEN))) : 0U)</span></div>
</div>
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> </div>
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span><span class="preprocessor">#ifdef NO_DECLTYPE</span></div>
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span><span class="preprocessor">#define HASH_ITER(hh,head,el,tmp)                                                \</span></div>
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span><span class="preprocessor">for(((el)=(head)), ((*(char**)(&amp;(tmp)))=(char*)((head!=NULL)?(head)-&gt;hh.next:NULL)); \</span></div>
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span><span class="preprocessor">  (el) != NULL; ((el)=(tmp)), ((*(char**)(&amp;(tmp)))=(char*)((tmp!=NULL)?(tmp)-&gt;hh.next:NULL)))</span></div>
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span><span class="preprocessor">#else</span></div>
<div class="foldopen" id="foldopen01031" data-start="" data-end="">
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"><a class="line" href="uthash_8h.html#a4d524042f1fcb976d8bccae9e4cc63d6"> 1031</a></span><span class="preprocessor">#define HASH_ITER(hh,head,el,tmp)                                                \</span></div>
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span><span class="preprocessor">for(((el)=(head)), ((tmp)=DECLTYPE(el)((head!=NULL)?(head)-&gt;hh.next:NULL));      \</span></div>
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span><span class="preprocessor">  (el) != NULL; ((el)=(tmp)), ((tmp)=DECLTYPE(el)((tmp!=NULL)?(tmp)-&gt;hh.next:NULL)))</span></div>
</div>
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> </div>
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span><span class="comment">/* obtain a count of items in the hash */</span></div>
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"><a class="line" href="uthash_8h.html#a7d3edf55a3ee4da1a0e1b477c314342f"> 1037</a></span><span class="preprocessor">#define HASH_COUNT(head) HASH_CNT(hh,head)</span></div>
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"><a class="line" href="uthash_8h.html#a6ea9e661cd8c35eff1fdcd5731127edd"> 1038</a></span><span class="preprocessor">#define HASH_CNT(hh,head) ((head != NULL)?((head)-&gt;hh.tbl-&gt;num_items):0U)</span></div>
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> </div>
<div class="foldopen" id="foldopen01040" data-start="{" data-end="};">
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html"> 1040</a></span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__bucket.html">UT_hash_bucket</a> {</div>
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html#a785a785132212378bb28fb4341cfecaf"> 1041</a></span>   <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code hl_variable" href="structUT__hash__bucket.html#a785a785132212378bb28fb4341cfecaf">hh_head</a>;</div>
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html#a5d20cc12bdcbde360398910eefb45634"> 1042</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__bucket.html#a5d20cc12bdcbde360398910eefb45634">count</a>;</div>
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> </div>
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span>   <span class="comment">/* expand_mult is normally set to 0. In this situation, the max chain length</span></div>
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span><span class="comment">    * threshold is enforced at its default value, HASH_BKT_CAPACITY_THRESH. (If</span></div>
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span><span class="comment">    * the bucket&#39;s chain exceeds this length, bucket expansion is triggered).</span></div>
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span><span class="comment">    * However, setting expand_mult to a non-zero value delays bucket expansion</span></div>
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span><span class="comment">    * (that would be triggered by additions to this particular bucket)</span></div>
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span><span class="comment">    * until its chain length reaches a *multiple* of HASH_BKT_CAPACITY_THRESH.</span></div>
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span><span class="comment">    * (The multiplier is simply expand_mult+1). The whole idea of this</span></div>
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span><span class="comment">    * multiplier is to reduce bucket expansions, since they are expensive, in</span></div>
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span><span class="comment">    * situations where we know that a particular bucket tends to be overused.</span></div>
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span><span class="comment">    * It is better to let its chain length grow to a longer yet-still-bounded</span></div>
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span><span class="comment">    * value, than to do an O(n) bucket expansion too often.</span></div>
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span><span class="comment">    */</span></div>
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"><a class="line" href="structUT__hash__bucket.html#a9b739c1b69c141e8198c0c64af643b2b"> 1056</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__bucket.html#a9b739c1b69c141e8198c0c64af643b2b">expand_mult</a>;</div>
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span> </div>
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"><a class="line" href="uthash_8h.html#a3775136bedd7fc8db3ad7c1ad6a7218e"> 1058</a></span>} <a class="code hl_struct" href="structUT__hash__bucket.html">UT_hash_bucket</a>;</div>
</div>
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> </div>
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span><span class="comment">/* random signature used only to find hash tables in external analysis */</span></div>
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"><a class="line" href="uthash_8h.html#a4a7a46b9b92a9c73e4f9321e8e6b6bb2"> 1061</a></span><span class="preprocessor">#define HASH_SIGNATURE 0xa0111fe1u</span></div>
<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"><a class="line" href="uthash_8h.html#a18a33f4269f05c1e81ce54edbc0ffca6"> 1062</a></span><span class="preprocessor">#define HASH_BLOOM_SIGNATURE 0xb12220f2u</span></div>
<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> </div>
<div class="foldopen" id="foldopen01064" data-start="{" data-end="};">
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"><a class="line" href="structUT__hash__table.html"> 1064</a></span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__table.html">UT_hash_table</a> {</div>
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a04556bbef9c9a1c40b1bc0d17a2a6e0b"> 1065</a></span>   <a class="code hl_struct" href="structUT__hash__bucket.html">UT_hash_bucket</a> *<a class="code hl_variable" href="structUT__hash__table.html#a04556bbef9c9a1c40b1bc0d17a2a6e0b">buckets</a>;</div>
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#ae376a7f3fac525f3a9d03b6beec8d12f"> 1066</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__table.html#a3ed04b6233facaedf910672578d86339">num_buckets</a>, <a class="code hl_variable" href="structUT__hash__table.html#ae376a7f3fac525f3a9d03b6beec8d12f">log2_num_buckets</a>;</div>
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a74534cc14f080c96f94d8f5da83d9d76"> 1067</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__table.html#a74534cc14f080c96f94d8f5da83d9d76">num_items</a>;</div>
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a00a889a5e1ebaeec0a83ec2701df1992"> 1068</a></span>   <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code hl_variable" href="structUT__hash__table.html#a00a889a5e1ebaeec0a83ec2701df1992">tail</a>; <span class="comment">/* tail hh in app order, for fast append    */</span></div>
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#afd05f4d9e45354fb010367ae9e1bddb6"> 1069</a></span>   ptrdiff_t <a class="code hl_variable" href="structUT__hash__table.html#afd05f4d9e45354fb010367ae9e1bddb6">hho</a>; <span class="comment">/* hash handle offset (byte pos of hash handle in element */</span></div>
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> </div>
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span>   <span class="comment">/* in an ideal situation (all buckets used equally), no bucket would have</span></div>
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span><span class="comment">    * more than ceil(#items/#buckets) items. that&#39;s the ideal chain length. */</span></div>
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a5f1cec93d5d753ba02097c797e4d67ad"> 1073</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__table.html#a5f1cec93d5d753ba02097c797e4d67ad">ideal_chain_maxlen</a>;</div>
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> </div>
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span>   <span class="comment">/* nonideal_items is the number of items in the hash whose chain position</span></div>
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span><span class="comment">    * exceeds the ideal chain maxlen. these items pay the penalty for an uneven</span></div>
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span><span class="comment">    * hash distribution; reaching them in a chain traversal takes &gt;ideal steps */</span></div>
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a8cb66cfb259a204cda59a815e4db664f"> 1078</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__table.html#a8cb66cfb259a204cda59a815e4db664f">nonideal_items</a>;</div>
<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span> </div>
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span>   <span class="comment">/* ineffective expands occur when a bucket doubling was performed, but</span></div>
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span><span class="comment">    * afterward, more than half the items in the hash had nonideal chain</span></div>
<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span><span class="comment">    * positions. If this happens on two consecutive expansions we inhibit any</span></div>
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span><span class="comment">    * further expansion, as it&#39;s not helping; this happens when the hash</span></div>
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span><span class="comment">    * function isn&#39;t a good fit for the key domain. When expansion is inhibited</span></div>
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span><span class="comment">    * the hash will still work, albeit no longer in constant time. */</span></div>
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a216c7d98cf40a0064bee94aa8a5bf1b7"> 1086</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__table.html#a216c7d98cf40a0064bee94aa8a5bf1b7">ineff_expands</a>, <a class="code hl_variable" href="structUT__hash__table.html#a635661789933752e7b83dac84430eae1">noexpand</a>;</div>
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span> </div>
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"><a class="line" href="structUT__hash__table.html#a87d1ab3f3ede1809c6a485972d20b25f"> 1088</a></span>   <a class="code hl_typedef" href="uthash_8h.html#a435d1572bf3f880d55459d9805097f62">uint32_t</a> <a class="code hl_variable" href="structUT__hash__table.html#a87d1ab3f3ede1809c6a485972d20b25f">signature</a>; <span class="comment">/* used only to find hash tables in external analysis */</span></div>
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span><span class="preprocessor">#ifdef HASH_BLOOM</span></div>
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span>   <a class="code hl_typedef" href="uthash_8h.html#a435d1572bf3f880d55459d9805097f62">uint32_t</a> bloom_sig; <span class="comment">/* used only to test bloom exists in external analysis */</span></div>
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span>   <a class="code hl_typedef" href="uthash_8h.html#aba7bc1797add20fe3efdf37ced1182c5">uint8_t</a> *bloom_bv;</div>
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span>   <a class="code hl_typedef" href="uthash_8h.html#aba7bc1797add20fe3efdf37ced1182c5">uint8_t</a> bloom_nbits;</div>
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span> </div>
<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"><a class="line" href="uthash_8h.html#ade349c45717e328f0337b6fe5a0658bf"> 1095</a></span>} <a class="code hl_struct" href="structUT__hash__table.html">UT_hash_table</a>;</div>
</div>
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span> </div>
<div class="foldopen" id="foldopen01097" data-start="{" data-end="};">
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html"> 1097</a></span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__handle.html">UT_hash_handle</a> {</div>
<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#ad2035ee3b2aa55b22e352341372a5e73"> 1098</a></span>   <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__table.html">UT_hash_table</a> *<a class="code hl_variable" href="structUT__hash__handle.html#ad2035ee3b2aa55b22e352341372a5e73">tbl</a>;</div>
<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#abaf54a69367933df2d45575f48ca6a58"> 1099</a></span>   <span class="keywordtype">void</span> *<a class="code hl_variable" href="structUT__hash__handle.html#abaf54a69367933df2d45575f48ca6a58">prev</a>;                       <span class="comment">/* prev element in app order      */</span></div>
<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a93bc88ffe97f85ea0d9e0056b7118942"> 1100</a></span>   <span class="keywordtype">void</span> *<a class="code hl_variable" href="structUT__hash__handle.html#a93bc88ffe97f85ea0d9e0056b7118942">next</a>;                       <span class="comment">/* next element in app order      */</span></div>
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a3ec03e34d7975d5c1981c44b324619b2"> 1101</a></span>   <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code hl_variable" href="structUT__hash__handle.html#a3ec03e34d7975d5c1981c44b324619b2">hh_prev</a>;   <span class="comment">/* previous hh in bucket order    */</span></div>
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a4f6989385499ba6f594b0f0facd28325"> 1102</a></span>   <span class="keyword">struct </span><a class="code hl_struct" href="structUT__hash__handle.html">UT_hash_handle</a> *<a class="code hl_variable" href="structUT__hash__handle.html#a4f6989385499ba6f594b0f0facd28325">hh_next</a>;   <span class="comment">/* next hh in bucket order        */</span></div>
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#a8a850ff11c07f6fd424e2ef9f592582f"> 1103</a></span>   <span class="keyword">const</span> <span class="keywordtype">void</span> *<a class="code hl_variable" href="structUT__hash__handle.html#a8a850ff11c07f6fd424e2ef9f592582f">key</a>;                  <span class="comment">/* ptr to enclosing struct&#39;s key  */</span></div>
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#af2abdc405972a6bbdee2ade2c0f346c4"> 1104</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__handle.html#af2abdc405972a6bbdee2ade2c0f346c4">keylen</a>;                  <span class="comment">/* enclosing struct&#39;s key len     */</span></div>
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"><a class="line" href="structUT__hash__handle.html#aae5e635fa110556e5007f627089f8323"> 1105</a></span>   <span class="keywordtype">unsigned</span> <a class="code hl_variable" href="structUT__hash__handle.html#aae5e635fa110556e5007f627089f8323">hashv</a>;                   <span class="comment">/* result of hash-fcn(key)        */</span></div>
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"><a class="line" href="uthash_8h.html#a817624f072ea116d638b237d518d6f6a"> 1106</a></span>} <a class="code hl_struct" href="structUT__hash__handle.html">UT_hash_handle</a>;</div>
</div>
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span> </div>
<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span><span class="preprocessor">#endif </span><span class="comment">/* UTHASH_H */</span><span class="preprocessor"></span></div>
<div class="ttc" id="astructUT__hash__bucket_html"><div class="ttname"><a href="structUT__hash__bucket.html">UT_hash_bucket</a></div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01040">uthash.h:1040</a></div></div>
<div class="ttc" id="astructUT__hash__bucket_html_a5d20cc12bdcbde360398910eefb45634"><div class="ttname"><a href="structUT__hash__bucket.html#a5d20cc12bdcbde360398910eefb45634">UT_hash_bucket::count</a></div><div class="ttdeci">unsigned count</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01042">uthash.h:1042</a></div></div>
<div class="ttc" id="astructUT__hash__bucket_html_a785a785132212378bb28fb4341cfecaf"><div class="ttname"><a href="structUT__hash__bucket.html#a785a785132212378bb28fb4341cfecaf">UT_hash_bucket::hh_head</a></div><div class="ttdeci">struct UT_hash_handle * hh_head</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01041">uthash.h:1041</a></div></div>
<div class="ttc" id="astructUT__hash__bucket_html_a9b739c1b69c141e8198c0c64af643b2b"><div class="ttname"><a href="structUT__hash__bucket.html#a9b739c1b69c141e8198c0c64af643b2b">UT_hash_bucket::expand_mult</a></div><div class="ttdeci">unsigned expand_mult</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01056">uthash.h:1056</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html"><div class="ttname"><a href="structUT__hash__handle.html">UT_hash_handle</a></div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01097">uthash.h:1097</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_a3ec03e34d7975d5c1981c44b324619b2"><div class="ttname"><a href="structUT__hash__handle.html#a3ec03e34d7975d5c1981c44b324619b2">UT_hash_handle::hh_prev</a></div><div class="ttdeci">struct UT_hash_handle * hh_prev</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01101">uthash.h:1101</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_a4f6989385499ba6f594b0f0facd28325"><div class="ttname"><a href="structUT__hash__handle.html#a4f6989385499ba6f594b0f0facd28325">UT_hash_handle::hh_next</a></div><div class="ttdeci">struct UT_hash_handle * hh_next</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01102">uthash.h:1102</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_a8a850ff11c07f6fd424e2ef9f592582f"><div class="ttname"><a href="structUT__hash__handle.html#a8a850ff11c07f6fd424e2ef9f592582f">UT_hash_handle::key</a></div><div class="ttdeci">const void * key</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01103">uthash.h:1103</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_a93bc88ffe97f85ea0d9e0056b7118942"><div class="ttname"><a href="structUT__hash__handle.html#a93bc88ffe97f85ea0d9e0056b7118942">UT_hash_handle::next</a></div><div class="ttdeci">void * next</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01100">uthash.h:1100</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_aae5e635fa110556e5007f627089f8323"><div class="ttname"><a href="structUT__hash__handle.html#aae5e635fa110556e5007f627089f8323">UT_hash_handle::hashv</a></div><div class="ttdeci">unsigned hashv</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01105">uthash.h:1105</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_abaf54a69367933df2d45575f48ca6a58"><div class="ttname"><a href="structUT__hash__handle.html#abaf54a69367933df2d45575f48ca6a58">UT_hash_handle::prev</a></div><div class="ttdeci">void * prev</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01099">uthash.h:1099</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_ad2035ee3b2aa55b22e352341372a5e73"><div class="ttname"><a href="structUT__hash__handle.html#ad2035ee3b2aa55b22e352341372a5e73">UT_hash_handle::tbl</a></div><div class="ttdeci">struct UT_hash_table * tbl</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01098">uthash.h:1098</a></div></div>
<div class="ttc" id="astructUT__hash__handle_html_af2abdc405972a6bbdee2ade2c0f346c4"><div class="ttname"><a href="structUT__hash__handle.html#af2abdc405972a6bbdee2ade2c0f346c4">UT_hash_handle::keylen</a></div><div class="ttdeci">unsigned keylen</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01104">uthash.h:1104</a></div></div>
<div class="ttc" id="astructUT__hash__table_html"><div class="ttname"><a href="structUT__hash__table.html">UT_hash_table</a></div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01064">uthash.h:1064</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a00a889a5e1ebaeec0a83ec2701df1992"><div class="ttname"><a href="structUT__hash__table.html#a00a889a5e1ebaeec0a83ec2701df1992">UT_hash_table::tail</a></div><div class="ttdeci">struct UT_hash_handle * tail</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01068">uthash.h:1068</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a04556bbef9c9a1c40b1bc0d17a2a6e0b"><div class="ttname"><a href="structUT__hash__table.html#a04556bbef9c9a1c40b1bc0d17a2a6e0b">UT_hash_table::buckets</a></div><div class="ttdeci">UT_hash_bucket * buckets</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01065">uthash.h:1065</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a216c7d98cf40a0064bee94aa8a5bf1b7"><div class="ttname"><a href="structUT__hash__table.html#a216c7d98cf40a0064bee94aa8a5bf1b7">UT_hash_table::ineff_expands</a></div><div class="ttdeci">unsigned ineff_expands</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01086">uthash.h:1086</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a3ed04b6233facaedf910672578d86339"><div class="ttname"><a href="structUT__hash__table.html#a3ed04b6233facaedf910672578d86339">UT_hash_table::num_buckets</a></div><div class="ttdeci">unsigned num_buckets</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01066">uthash.h:1066</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a5f1cec93d5d753ba02097c797e4d67ad"><div class="ttname"><a href="structUT__hash__table.html#a5f1cec93d5d753ba02097c797e4d67ad">UT_hash_table::ideal_chain_maxlen</a></div><div class="ttdeci">unsigned ideal_chain_maxlen</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01073">uthash.h:1073</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a635661789933752e7b83dac84430eae1"><div class="ttname"><a href="structUT__hash__table.html#a635661789933752e7b83dac84430eae1">UT_hash_table::noexpand</a></div><div class="ttdeci">unsigned noexpand</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01086">uthash.h:1086</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a74534cc14f080c96f94d8f5da83d9d76"><div class="ttname"><a href="structUT__hash__table.html#a74534cc14f080c96f94d8f5da83d9d76">UT_hash_table::num_items</a></div><div class="ttdeci">unsigned num_items</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01067">uthash.h:1067</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a87d1ab3f3ede1809c6a485972d20b25f"><div class="ttname"><a href="structUT__hash__table.html#a87d1ab3f3ede1809c6a485972d20b25f">UT_hash_table::signature</a></div><div class="ttdeci">uint32_t signature</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01088">uthash.h:1088</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_a8cb66cfb259a204cda59a815e4db664f"><div class="ttname"><a href="structUT__hash__table.html#a8cb66cfb259a204cda59a815e4db664f">UT_hash_table::nonideal_items</a></div><div class="ttdeci">unsigned nonideal_items</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01078">uthash.h:1078</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_ae376a7f3fac525f3a9d03b6beec8d12f"><div class="ttname"><a href="structUT__hash__table.html#ae376a7f3fac525f3a9d03b6beec8d12f">UT_hash_table::log2_num_buckets</a></div><div class="ttdeci">unsigned log2_num_buckets</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01066">uthash.h:1066</a></div></div>
<div class="ttc" id="astructUT__hash__table_html_afd05f4d9e45354fb010367ae9e1bddb6"><div class="ttname"><a href="structUT__hash__table.html#afd05f4d9e45354fb010367ae9e1bddb6">UT_hash_table::hho</a></div><div class="ttdeci">ptrdiff_t hho</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l01069">uthash.h:1069</a></div></div>
<div class="ttc" id="authash_8h_html_a435d1572bf3f880d55459d9805097f62"><div class="ttname"><a href="uthash_8h.html#a435d1572bf3f880d55459d9805097f62">uint32_t</a></div><div class="ttdeci">unsigned int uint32_t</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l00078">uthash.h:78</a></div></div>
<div class="ttc" id="authash_8h_html_aba7bc1797add20fe3efdf37ced1182c5"><div class="ttname"><a href="uthash_8h.html#aba7bc1797add20fe3efdf37ced1182c5">uint8_t</a></div><div class="ttdeci">unsigned char uint8_t</div><div class="ttdef"><b>Definition</b> <a href="uthash_8h_source.html#l00079">uthash.h:79</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_a14d23a24002734ac2a3b997119f008e.html">coap2</a></li><li class="navelem"><a class="el" href="uthash_8h.html">uthash.h</a></li>
    <li class="footer">Generated on Fri Dec 27 2024 09:57:44 for libcoap by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
  </ul>
</div>
</body>
</html>
